#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

class Radix {
private:
	const char* s;
	int a[128];
public:
	Radix(const char* s = "0123456789ABCDEF") : s(s) {
		int i;
		for (i = 0; s[i]; ++i)
			a[(int)s[i]] = i;
	}
	std::string to(long long p, int q) {
		int i;
		if (!p)
			return "0";
		char t[64] = { };
		for (i = 62; p; --i) {
			t[i] = s[p % q];
			p /= q;
		}
		return std::string(t + i + 1);
	}
	std::string to(const std::string& t, int p, int q) {
		return to(to(t, p), q);
	}
	long long to(const std::string& t, int p) {
		int i;
		long long sm = a[(int)t[0]];
		for (i = 1; i < (int)t.length(); ++i)
			sm = sm * p + a[(int)t[i]];
		return sm;
	}
};

int main() {
	Radix r;
	int n; cin >> n;
	cout << r.to(n, 7) << endl;
}