#include <cstdio>

 #include <cmath>

 #include <set>

 #include <cassert>

 using namespace std;

 typedef unsigned long long ULL;

 typedef set<ULL>::iterator It;

 bool vis[];

 ULL POW(int a, int p)

 {

     ULL ans = , base = a;

     while(p)

     {

         if(p & 1ULL) ans *= base;

         base *= base;

         p >>= ;

     }

     return ans;

 }

 int main()

 {

     for(int i = ; i <= ; i++) if(!vis[i])

         for(int j = i * i; j <= ; j += i) vis[j] = true;

     set<ULL> ans;

     ans.insert();

     for(int base = ; base < ; base++)

         for(int p = ; p < (int)ceil(64.0 * log(2.0) / log(base)); p++) if(vis[p])

         {

             ULL v = POW(base, p);

             assert(v != 1ULL); assert(v != );

             if(!ans.count(v)) ans.insert(v);

         }

     for(It i = ans.begin(); i != ans.end(); i++)

         printf("%llu\n", *i);

     return ;

 }