#include <bits/stdc++.h>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7;


map<ll, ll> prime[MAX*10*2];
void factrization(ll n) {
  ll id=n;
  for(ll i=2; i*i<=n; i++) {
    while(n%i==0) {
      prime[id][i]++;
      n/=i;
    }
  }
  
  if(n>1) prime[id][n]++;
}



int main(void) {
  ll X;
  cin >> X;
  ll i;
  
  for(i=1; i<X; i++) factrization(i);
  
  
  
  
}