#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <cstring>
#include <queue>
#include <stack>
#include <functional>
#include <math.h>
#include <iomanip>
using namespace std;
#define Would
#define you
const int INF = 999999999;
const int MOD = 1e9 + 7;

int main() {
	long long n;
	vector<int>v;
	cin >> n;
	if (n == 0) {
		cout << 0 << endl;
		return 0;
	}
	while (n) {
		v.push_back(n % 7);
		n /= 7;
	}
	reverse(v.begin(), v.end());
	for (int i = 0; i < v.size(); ++i) { cout << v[i]; }
	cout << endl;
}