#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

#define mod (ll)(1e9+7);

using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pr;

int N;
int a[100];

int main()
{
	cin >> N;
	int i = 0;
	while (N >= 7) {
		a[i] = N % 7;
		N /= 7;
		i++;
	}
	a[i] = N;
	for (int j = i; j >= 0; j--)
		cout << a[j];
	cout << endl;
	return 0;
}