public class Euler76 {
    public static void main(String[] args) {
        int n = 100;
        long[] ways = new long[n + 1];
        ways[0] = 1;
        for (int part = 1; part < n; part++)
            for (int s = part; s <= n; s++)
                ways[s] += ways[s - part];
        System.out.println(ways[n]);
    }
}