#include <iostream>
using namespace std;
int a[2000000];
int n,ans=0,now=2,t,last=0;
void swim(int k)
{
    while(k>1&&a[k]<a[k/2])
    {
        swap(a[k],a[k/2]);
        k/=2;
    }
}
void sink(int k)
{
    while(2*k<now)
    {
        int j=2*k;
        if(j+1<now&&a[j]>a[j+1])++j;
        if(a[k]<a[j])return;
        swap(a[k],a[j]);
        k=j;
    }
}
int main()
{
    freopen("minvalinset.in","r",stdin);
    freopen("minvalinset.out","w",stdout);
    scanf("%d",&n);
    a[1]=1;
    while(ans<n)
    {
        if(a[1]>last)
        {
            printf("%d ",a[1]);
            ++ans;
            last=a[1];
        }
        t=a[1];
        if(t>1073741820)
        {
            a[1]=a[--now];
            sink(1);
            continue;
        }
        a[1]=2*t+1;
        sink(1);
        if(t>715827880)continue;
        a[now]=3*t+1;
        swim(now++);
    }
    return 0;
}