#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n;
    cin >> n;
    double ans = 1.0;
    for (int i = 2; i < n; ++i) {
        ans -= riemann_zeta(i)-1.0;
    }
    printf("%.0lf\n", floor(ans*1e6));
    return 0;
}