#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <stack>
using namespace std;
int n, m;
int x, y;
int field[20][20];
int main() {
    cin >> n;
    vector<int> v;
    long long divisor=7;
    do{
        divisor*=7;
    } while(divisor<1000000000);
    bool flag = false;
    while(true){
        if(n/divisor!=0) flag = true;
        if(flag){
        v.push_back(n/divisor);
        n = n%divisor;
        }
        divisor/=7;
        if(n<7){
            v.push_back(n);
            break;
        }
    }
    for(int i=0; i<v.size(); ++i){
        cout << v[i];
    }
    cout << endl;
        
    return 0;
}