#include using namespace std; typedef long long ll; typedef long double ld; typedef pair P; typedef pair Pi; #define rep(i,n) for(ll i=0;i inline bool chmax(T &a, T b){if(a inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;} template ostream& operator<<(ostream& s,const complex& d) {return s<<"("< ostream& operator<<(ostream& s,const pair& d) {return s<<"("< ostream& operator<<(ostream& s, const vector& d){int len=d.size();rep(i,len){s< ostream& operator<<(ostream& s,const vector>& d){int len=d.size();rep(i,len){s< ostream& operator<<(ostream& s,const set& v){s<<"{ ";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< ", ";}s<<(*itr);}s<<" }";return s;} template ostream& operator<<(ostream& s,const multiset& v){s<<"{ ";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< ", ";}s<<(*itr);}s<<" }";return s;} template ostream& operator<<(ostream& s,const map& m){s<<"{"< bool is_prime(T x){ for(T i=2;i*i<=x;i++){ if(x%i==0){ return false; } } return x!=1; } int main(){ cin.tie(0);ios::sync_with_stdio(false); int n; cin>>n; vector num; ll now=100001; while(num.size() ne; rep(i,num.size())rep(j,num.size()){ ne.push_back(num[i]*num[j]); } ne.push_back(1); sort(begin(ne),end(ne)); ne.erase(unique(begin(ne),end(ne)),end(ne)); cout<