#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1000000007;
const long long int INF = LONG_LONG_MAX;
const vector<vector<long long int> > adj4({{0, 1}, {0, -1}, {1, 0}, {-1, 0}});
const vector<vector<long long int> > adj8(
    {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {-1, -1}, {1, -1}, {-1, 1}, {1, 1}});
long long int gcd(long long int a, long long int b) {
  return b == 0 ? a : gcd(b, a % b);
}
bool isprime(long long int n) {
  if (n == 2 || n == 3) return true;
  if (n < 2 || n % 2 == 0 || n % 3 == 0) return false;
  for (long long int i = 6; (i - 1) * (i - 1) <= n; i += 6) {
    if (n % (i - 1) == 0 || n % (i + 1) == 0) {
      return false;
    }
  }
  return true;
}
vector<bool> sprime;
void genPrime(long long int sz) {
  sprime = vector<bool>(sz, true);
  sprime[0] = false;
  sprime[1] = false;
  for (long long int i = (2); i < (sz); ++i) {
    if (sprime[i]) {
      for (long long int j = i * i; j < sz; j += i) {
        sprime[j] = false;
      }
    }
  }
}
long long int powMod(long long int a, long long int b, long long int mod) {
  long long int n = 1;
  long long int p = a;
  while (b > 0) {
    if (b % 2 == 1) {
      n *= p;
      n %= mod;
    }
    p *= p;
    p %= mod;
    b /= 2;
  }
  return n;
}
long long int modularInverse(long long int a, long long int mod) {
  return powMod(a, mod - 2, mod);
}
long long int bsfunction(long long int n) { return 0; }
long long int binarysearch(long long int left, long long int right,
                           long long int target) {
  if (left == right) {
    return left;
  }
  long long int mid =
      (left + right > 0) ? (left + right) / 2 : (left + right - 1) / 2;
  long long int val = bsfunction(mid);
  if (val > target) {
    return binarysearch(left, mid, target);
  } else if (val == target) {
    return mid;
  } else {
    return binarysearch(mid + 1, right, target);
  }
}
stringstream sss;
void MAIN() {
  long long int n;
  cin >> n;
  vector<bool> a(n + 1, true);
  a[0] = false;
  long long int x = 1;
  long long int y = 0;
  while (y < n - 1) {
    for (long long int j = x; j <= n; j += x * 2LL) {
      if (y < n - 2) {
        a[j] = false;
      }
      cout << x << ' ';
      ++y;
      if (y == n - 1) break;
    }
    x *= 2LL;
  }
  for (long long int i = (n + 1) - 1; i >= 0; --i) {
    if (a[i]) {
      cout << (i) << endl;
      break;
    }
  }
}
const long long int TESTCASEN = 1;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << setprecision(10);
  sss << R"(
1000000
    )";
  for (long long int i = 0; i < (TESTCASEN); ++i) {
    MAIN();
  }
  return 0;
}
