#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include <iomanip>
typedef long long int ll;
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define EREP(i,n) for (int i=1;i<=(n);i++)
#define EVEL 1

#ifndef EVEL
#define DEB(X) cout << #X << ":" <<X<<" " ;
#define TF(f) f ? cout<<"true  " : cout<<"false ";
#define END cout<<"\n";
#else
#define DEB(X) {X=X;}
#define TF(f) {f=f;}
#define END {}
#endif
const int MOD = 1000000007;
const int INF = 1000000;
#define NMAX 50
#define MAX 10
     vector<ll> sev;
 int main(){
     ll N,ans=1;
     ios_base::sync_with_stdio(false);
     cin>>N;
     while(N>0){
         
         sev.push_back(N%7);
         N/=7;
     }
     //sev.push_back(N%7);
     /*sev.push_back(N);*/
    
     for(int i=sev.size()-1;i>=0;i--){
         cout<<sev[i];
     }
     if(sev.size()==0){
        cout<<0;
     }
     
     //cout<<ans<<endl;
 }