#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }

/*
  \sum_{i>=2} (\zeta(i) - 1)
  = \sum_{i>=2} \sum_{j>=2} j^(-i)
  = \sum_{j>=2} j^(-2) / (1 - j^(-1))
  = \sum_{j>=2} 1 / (j^2 - j)
  = 1
*/

int main() {
  int X;
  for (; ~scanf("%d", &X); ) {
    double ans = 1.0;
    for (int i = 2; i < X; ++i) {
      ans -= (riemann_zeta(i) - 1.0);
    }
    printf("%lld\n", (Int)floor(ans * 1e6));
  }
  return 0;
}