public class Euler115 {
    static long countWays(int len, int minBlock) {
        long[] dp=new long[len+1]; dp[0]=1;
        for(int n=1;n<=len;n++){dp[n]=dp[n-1];for(int b=minBlock;b<=n;b++)dp[n]+=(b==n)?1:dp[n-b-1];}
        return dp[len];
    }
    public static void main(String[] args) {
        for(int n=0;;n++)if(countWays(n,50)>1000000){System.out.println(n);return;}
    }
}