#include <iostream>

using namespace std;

bool PrimalityCheck(int num)
{
    bool flag=true;
    for(int i = 2; i <= num / 2; i++) {
       if(num % i == 0) {
          flag = false;
          break;
       }
    }
    return flag;
}

int main(int argc, char** argv)
{
    int primeArraySize = 1;
    int *primesOfN = (int *)calloc(primeArraySize, sizeof(int));
    int n = atoi(argv[1]);
    for (int i = n; i >= 1; i--)
    {
        if (PrimalityCheck(i))
        {
            primesOfN = (int *)realloc(primesOfN, 1);
            primesOfN[primeArraySize-1] = i;
            primeArraySize += 1;
        }
    }
    primeArraySize -= 1;
    for (int i = 0; i < primeArraySize; i++)
    {
        cout << primesOfN[i] << " ";
    }
}