#include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int (i)=(a);(i)<(int)(b);++(i))
#define RREP(i,a,b) for(int (i)=(a);(i)>=(int)(b);--(i))
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;

vector<int> ans;

int main(){
    int n;
    cin >> n;
    if (n == 0) cout << 0 << endl;
    while(n > 0){
        ans.push_back(n % 7);
        n /= 7;
    }
    reverse(ans.begin(), ans.end());
    REP(i,0,ans.size()) cout << ans[i];
    cout << endl;
    
    return 0;
}