#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
int a[maxn];
int main() {
  int n;
  scanf("%d", &n);
  int m = 0, k = 1;
  while (n) {
    int i = m;
    if (n == 3) {
      a[m] = a[m + 1] = k, a[m + 2] = k * 3;
      m += 3;
      break;
    }
    for (; i < m + n - n / 2; i++) a[i] = k;
    m = i;
    n >>= 1;
    k <<= 1;
  }
  for (int i = 0; i < m; i++) printf("%d\n", a[i]);
}
