public class Summat2 {
    public static long laske(int n) {
        long[][] muisti = new long[n+1][n+1];
        for (int i = 0; i <= n; i++) {
            muisti[0][i] = 1;
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                muisti[i][j] += muisti[i][j-1];
                if (j > i) continue;
                muisti[i][j] += muisti[i-j][j];
            }
        }
        return muisti[n][n];
    }

    public static void main(String[] args) {
        System.out.println(laske(250));
    }
}
