#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N;
  cin >> N;

  for (int d = 3; d <= 25; ++d) {
    for (int mask = 0; mask < (1 << d); ++mask) {
      if ((mask & 1) == 0) continue;
      if (__builtin_popcount(mask) % 3 != 0) continue;

      --N;
      if (N == 0) {
        string ans = "";
        for (int i = 0; i < d; ++i){
          if ((mask >> (d - i - 1)) & 1) {
            ans += "5";
          } else {
            ans += "3";
          }
        }
        cout << ans << endl;
        break;
      }
    }
  }

  return 0;
}