#include <iostream>
#include <string>
#include <stdio.h>

using namespace std;
#define LL long long
LL calc(LL d){
    LL res=0;
    LL up=1;
    LL down=1;

    for(LL i = 1; i <= d; i++){
        up*=d-i+1;
        down*=i;
        if(i%3==2)
            res+=up/down;
    }
    return res;
}
int main() {
    LL N;
    cin>>N;
    LL d=2;
    LL prev=0;
    while(true){
        LL now=calc(d);
    //    cout<<now<<endl;
        if(prev+now>=N)break;
        prev+=now;
        d++;
    }
    //printf("prev=%lld,d=%lld\n",prev,d);
    for(int bit=0;bit<(1<<d);bit++){
        if(__builtin_popcount(bit)%3==2){
            prev++;
            //cout<<prev<<endl;
            if(prev==N){
                for(int i=d-1;i>=0;i--){
                    int k=((((bit>>i)&1)==1)?5:3);
                    cout<<k;
                }
                break;
            }
        }
    }
    cout<<5<<endl;

    return 0;
}