import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


long nextCombination(long p) {
  long q = p + (p & -p);
  return q | ((p & ~q) / (p & -p)) >> 1;
}

enum LIM = 25;
int N;

void main() {
  auto binom = new long[][LIM];
  foreach (i; 0 .. LIM) {
    binom[i] = new long[i + 1];
    binom[i][0] = binom[i][i] = 1;
    foreach (j; 1 .. i) {
      binom[i][j] = binom[i - 1][j - 1] + binom[i - 1][j];
    }
  }
  
  try {
    for (; ; ) {
      N = readInt();
      long n = N;
      foreach (i; 0 .. LIM) {
        long sum;
        foreach (j; 0 .. i + 1) {
          if ((j + 1) % 3 == 0) {
            sum += binom[i][j];
          }
        }
        if (n > sum) {
          n -= sum;
        } else {
debug{
writeln(i," ",n," ",sum);stdout.flush;
}
          long[] ps;
          foreach (j; 0 .. i + 1) {
            if ((j + 1) % 3 == 0) {
              long p = (1L << j) - 1;
              foreach (_; 0 .. binom[i][j]) {
                ps ~= p;
                p = nextCombination(p);
              }
            }
          }
          ps.sort;
          const ans = ps[cast(int)(n) - 1];
          foreach_reverse (k; 0 .. i) {
            write(((ans >> k) & 1) ? 5 : 3);
          }
          writeln(5);
          break;
        }
      }
    }
  } catch (EOFException e) {
  }
}