#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

const ll INF=1e9+1;

int main(){
    ll n;
    cin >> n;
    ll v=1;
    vector<ll> a(15),ans;
    rep(i,15){
        a[i]=v;
        v*=3;
    }
    for(ll i=1;i<(1<<15);i++){
        ll val=0;
        rep(j,15){
            if((i>>j)%2==1){
                val+=a[j];
            }
        }
        if(val>n || val==0) continue;
        ans.push_back(val);
    }
    sort(ans.begin(),ans.end());
    ll m=ans.size();
    rep(i,m){
        if(i) cout << " ";
        cout << ans[i];
    }
    cout << endl;
    return 0;
}