пирамида

#include <iostream>
#include <vector>
using namespace std;

long long number_of_splitting( int num ) {
    long long table[num+1][num+1];

    table[0][0] = 1;
    for( int i = 1; i <= num; i++ ) {
        table[0][i] = 1;
        table[i][0] = 0;
    }

    for( int i = 1; i <= num; i++ ) {
        for( int j = 1; j <= num; j++ ) {
            if( i >= j ) {
            table[i][j] = table[i][j-1] + table[i-j][j-1];
            } else {
                table[i][j] = table[i][j-1];
            }
        }
    }

    return table[num][num];
}

int main() {
    int n = 0;
    cin >> n;
    cout << number_of_splitting(n);

    return 0;
}