#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <unordered_map>
#include <string.h>
#include <utility>

typedef long long ll;
const int INF = 1e8;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

vector<int> ans;
void calc(int n){

	ans.push_back(n%7);

	int tmp = n/7;

/*	cout<<tmp<<endl;*/

	while(tmp >=7){
		ans.push_back(tmp%7);
		tmp /=7;
	}
	ans.push_back(tmp);
}


int main() {

	int N;
	cin>>N;

	if(N<7){
		cout<<N<<endl;
		return 0;
	}

	calc(N);

	reverse(ans.begin(),ans.end());

	for(int i=0; i<ans.size(); i++){
		cout<<ans[i];
	}
	cout<<endl;


return 0;

}