#include <iostream>
#include <iomanip>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <atcoder/modint>
#include <atcoder/dsu>
#include <atcoder/fenwicktree>
#include <atcoder/lazysegtree>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(a) a.begin(), a.end()
#define arr(a) a.rbegin(), a.rend()
using ll = long long;
using mint = atcoder::modint998244353;    //using mint = atcoder::modint1000000007;

//Konishii

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n; cin >> n;
    string res;
    if(n == 0) {
        cout << 0 << endl;
        return 0;
    }
    while(n > 0) {
        res.push_back(char(n%7+'0'));
        n /= 7;
    }
    reverse(all(res));
    cout << res << endl;
}