#include<iostream>
#include<vector>
#include<cmath>
#include<set>
#include<string>
#include<sstream>
#include <bits/stdc++.h>
#include "BigIntegerLibrary.hh"

using namespace std;

vector <bool> v;
vector <unsigned long long int> primers;
vector <vector <unsigned long long int> > factors;
vector <vector <unsigned long long int> > factorsrepet;

string int2string(int n){
    stringstream s;
    s << n; //el numero n passa a ser s
    return(s.str());
}

void garbell(){
    v[0]=false;
    v[1]=false;
    factors[0].push_back(0);
    factorsrepet[0].push_back(0);
    factorsrepet[0].push_back(1);
    factors[1].push_back(1);
    factorsrepet[1].push_back(1);
    factorsrepet[1].push_back(1);
    for(unsigned long long int i=2; i<v.size(); i++){
        if(v[i]){
            primers.push_back(i);
            factors[i].push_back(i);
            factorsrepet[i].push_back(i);
            for(unsigned long long int h=2; h*i<v.size(); h++){
                v[i*h] = 0;
                factors[i*h].push_back(i);
                unsigned long long int repet = h;
                unsigned long long int num = i;
                unsigned long long int quants = 1;
                while(repet%i==0){
                    repet = repet/i;
                    num = num*i;
                    quants++;
                }
                factors[i*h].push_back(quants);
                factorsrepet[i*h].push_back(num);
            }
        }
    }
}

int main(){
    int n;
    cin >> n;
    v = vector <bool> (n, true);
    primers = vector <unsigned long long int> ();
    factors = vector <vector <unsigned long long int>> (n);
    factorsrepet = vector <vector <unsigned long long int>> (n);
    garbell();
    for(int i=10; i<n; i++){
        unsigned long long int pi;
        for(unsigned long long int k=0; k<primers.size(); k++){
            if(primers[k]<i){
                pi = primers[k];
            }
            else{
                break;
            }
        }
    unsigned long long int pq = factorsrepet[i][0];
    for(int a=1; a<factorsrepet[i].size(); a++){
        if(factorsrepet[i][a]>pq){
            pq = factorsrepet[i][a];
        }
    }
    if(i-pi > pq){
        cout<<i<<endl;
    }
  }
}