CodeForces 1059C

Description

Let's call the following process a transformation of a sequence of length nn .

If the sequence is empty, the process ends. Otherwise, append the greatest common divisor (GCD) of all the elements of the sequence to the result and remove one arbitrary element from the sequence. Thus, when the process ends, we have a sequence of nn integers: the greatest common divisors of all the elements in the sequence before each deletion.

You are given an integer sequence 1,2,…,n1,2,…,n . Find the lexicographically maximum result of its transformation.

A sequence a1,a2,…,ana1,a2,…,an is lexicographically larger than a sequence b1,b2,…,bnb1,b2,…,bn , if there is an index ii such that aj=bjaj=bj for all j<ij<i , and ai>biai>bi .

Input

The first and only line of input contains one integer nn (1≤n≤1061≤n≤106 ).

Output

Output nn integers  — the lexicographically maximum result of the transformation.

Sample Input

 

Input

3

Output

1 1 3 

Input

2

Output

1 2 

Input

1

Output

1 

Sample Output

 

Hint

In the first sample the answer may be achieved this way:

• Append GCD(1,2,3)=1(1,2,3)=1 , remove 22 .
• Append GCD(1,3)=1(1,3)=1 , remove 11 .
• Append GCD(3)=3(3)=3 , remove 33 .

We get the sequence [1,1,3][1,1,3] as the result.

尽可能的让大的gcd值尽快出现。

有一条规则可以推出来，两个连续的数的gcd是1，所以第一步是将原数列变成奇数数列或偶数数列，又因为对于长度n大于3时，偶数数列肯定要先出现大的gcd，所以第一步将原数列转成偶数数列。

之后有趣的事情就出现了，可以发现，可以将形成的数列，奇数位上的数看“奇数数列”，偶数位上的数看成“偶数数列”，又重复第一步的过程。

在以上整个程中n都是大于3的，对于小于3的直接按“偶奇奇”的顺序删。

 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<string>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<stack>
 #include<deque>
 #include<map>
 #include<iostream>
 using namespace std;
 typedef long long  LL;
 const double pi=acos(-1.0);
 const double e=exp();
 const int N = ;

 int con[];

 int gcd(int a,int b)
 {
     int c;
     while(b)
     {
         c=b;
         b=a%b;
         a=c;
     }
     return a;
 }

 int main()
 {
     int i,p,j,n;
     int cnt=;
     scanf("%d",&n);
     for(i=;i<=n;i++)
         con[i]=i;
     p=n;
     while(p>)
     {
         if(p==)
         {
             printf("%d %d %d\n",gcd(gcd(con[],con[]),con[]),gcd(con[],con[]),con[]);
             break;
         }
         else if(p>=)
         {
             cnt=;
             int k=gcd(con[],con[]);
             for(i=;i<=p;i+=)
             {
                 printf("%d ",k);
                 if(i+<=p)
                     con[++cnt]=con[i+];
             }
             p=cnt;
         }
         else if(p==)
         {
             printf("%d\n",con[p]);
             break;
         }

     }
     return ;
 }