vector<vector<ll> > f; /// init as -1
ll magic(int left = n, int last = 0)
{
    if (left == 0) return 1;

    ll &res = f[left][last];
    if (res != -1) return res;
    res = 0;

    for (int next = last + 1; next <= left; ++next)
        res += magic(left - cur, next);

    return res;
}

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

#define all(x) (x).begin(), (x).end()
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef long long ll;

struct bignum {
    vector<int> d;
    bignum(int x = 0) {
        do d.push_back(x % 10);
        while (x /= 10);
    }

    void fix()
    {
        d.push_back(0);
        for (int i = 0; i + 1 < d.size(); ++i)
        {
            d[i + 1] += d[i] / 10; d[i] %= 10;
            if (d[i] < 0) { d[i + 1]--; d[i] += 10; }
        }
        while (d.size() >= 2 && d.back() == 0) d.pop_back();
    }

    void operator += (const bignum &a) {
        const vi &c = a.d;
        d.resize(max(c.size(), d.size()));
        for (int i = 0; i < c.size(); ++i) d[i] += c[i];
        fix();
    }

    void operator -= (const bignum &a) { 
        const vi &c = a.d;
        d.resize(max(c.size(), d.size()));
        for (int i = 0; i < c.size(); ++i) d[i] -= c[i];
        fix();
    }

    void out()   {  for (int i = int(d.size()) - 1; i >= 0; --i) cout << d[i]; }
    void outln() { out(); putchar('\n'); }
};

int n;
vector<vector<bignum> > f;
vector<vector<bool> > m;
bignum magic(int sum = 0, int cur = 1) {
    if (sum == n) return bignum({1});
    if (sum > n) return bignum({0});
    if (cur > n) return bignum({0});

    bignum &res = f[sum][cur];
    if (m[sum][cur]) return res; else m[sum][cur] = true;

    res += magic(sum + cur, cur + 1);
    res += magic(sum, cur + 1);
    
    return res;
}

int main()
{
    cin >> n;
    f.assign(n + 1, vector<bignum>(n + 1, bignum({0})));
    m.assign(n + 1, vector< bool >(n + 1, false));
    bignum res = trau();
    res -= bignum({1});
    res.outln();
}

include

include

include

using namespace std;

define all(x) (x).begin(), (x).end()

typedef pair<int, int> pi; typedef vector vi; typedef long long ll;

struct bignum { vector d; bignum(int x = 0) { do d.push_back(x % 10); while (x /= 10); } bignum(const vi &a) { d = a; reverse(all(d)); }

void fix()
{
    d.push_back(0);
    for (int i = 0; i + 1 < d.size(); ++i)
    {
        d[i + 1] += d[i] / 10; d[i] %= 10;
        if (d[i] < 0) { d[i + 1]--; d[i] += 10; }
    }
    while (d.size() >= 2 && d.back() == 0) d.pop_back();
}

void operator += (const bignum &a) {
    const vi &c = a.d;
    d.resize(max(c.size(), d.size()));
    for (int i = 0; i < c.size(); ++i) d[i] += c[i];
    fix();
}

void operator -= (const bignum &a) { 
    const vi &c = a.d;
    d.resize(max(c.size(), d.size()));
    for (int i = 0; i < c.size(); ++i) d[i] -= c[i];
    fix();
}

void out()   {  for (int i = int(d.size()) - 1; i >= 0; --i) cout << d[i]; }
void outln() { out(); putchar('\n'); }

};

int main() { int n; cin >> n;

vector<bignum> f(n + 1);
f[0] = f[1] = bignum(1);
for (int i = 2; i <= n; ++i)
    for (int j = n; j >= i; --j)
        f[j] += f[j - i];

f[n] -= 1;
f[n].out();

}