#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <deque>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <cassert>
#include <iostream>
 
using namespace std;
 
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(long long i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
 
#define MOD 1000000007

long long nCr[51][51];

void init_nCr(){
  memset(nCr, 0, sizeof(nCr));

  nCr[0][0] = 1;

  for(int i = 1; i <= 50; i++){
    for(int j = 0; j <= 50; j++){
      nCr[i][j] += nCr[i - 1][j];
      if(j - 1 >= 0){
        nCr[i][j] += nCr[i - 1][j - 1];
      }
    }
  }
}

int main(){
  int d[25]; // 数値を埋め込まないバージョン
  init_nCr();
  rep(i,0,25){
    int a = 0;
    int keta = i+1;
    for(int j = 3; j <= keta; j+=3){
      a += nCr[keta-1][(j-1)];
    }
    d[i]=a;
  }
  int n;
  cin >> n;
  int k = 0;
  rep(i,0,25){
    if(n-d[i]<=0){
      k = i;
      break;
    }
    n-=d[i];
  }
  rep(i,0,1<<k){
    int a = 5;
    rep(j,0,k){
      if((i>>j)&1){
        a += 5;
      }
      else{
        a += 3;
      }
    }
    if(a%3==0){
      n--;
      if(n==0){
        string s;
        rep(j,0,k){
          if((i>>j)&1){
            s += "5";
          }
          else{
            s += "3";
          }
        }
        reverse(all(s));
        s+="5";
        cout << s << endl;
        break;
      }
    }
  }
  return 0;
}