#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)

const ll mod = ll(1e9) + 7;
const int INF = 1<<29;

int main(){
    int n;
    cin >> n;
    vector<int> m;
    while (n>=7){
        m.push_back(n%7);
        n /= 7;
    }
    m.push_back(n);
    for (int i=m.size()-1;i>=0;i--) cout << m[i];
    cout << endl;
    return 0;
}