/* http://projecteuler.net/
 *
 * Problem 76
 * How many different ways can one hundred be written as a sum of at least
 * two positive integers?
 *
 * Solution by Melkor (Filip Niksic, fniksic@gmail.com)
 *
 **/

#include <iostream>

using namespace std;

const int N = 100;
int partitions[N+1] = {1, 0};

int main() {
    for (int n = 1; n < N; ++n)
	for (int k = n; k <= N; ++k)
	    partitions[k] += partitions[k - n];
    cout << partitions[N] << endl;
    return 0;
}