Problem: Welcome to CODE FESTIVAL 2016! In order to celebrate this contest, find a string s that satisfies the following conditions:

* The length of s is between 1 and 5000, inclusive.
* s consists of uppercase letters.
* s contains exactly K occurrences of the string "FESTIVAL" as a subsequence. In other words, there are exactly K tuples of integers (i_0, i_1, ..., i_7) such that 0 ≤ i_0 < i_1 < ... < i_7 ≤ |s|-1 and s[i_0]='F', s[i_1]='E', ..., s[i_7]='L'.



It can be proved that under the given constraints, the solution always exists. In case there are multiple possible solutions, you can output any.

Constraints

* 1 ≤ K ≤ 10^{18}

Input

The input is given from Standard Input in the following format:


K


Output

Print a string that satisfies the conditions.

Examples

Input

7


Output

FESSSSSSSTIVAL


Input

256


Output

FFEESSTTIIVVAALL

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
using namespace std;

using Int = __int128_t;
Int abs128(Int val){return val<0?-val:val;}

ostream &operator<<(ostream &os,Int val){
  if(ostream::sentry(os)){
    __uint128_t tmp=abs128(val);
    char buf[64];
    char *d=end(buf);
    do{
      --d;
      *d=char(tmp%10+'0');
      tmp/=10;
    }while(tmp);
    if(val<0) *--d='-';
    Int len=end(buf)-d;
    if(os.rdbuf()->sputn(d,len)!=len){
      os.setstate(ios_base::badbit);
    }
  }
  return os;
}

istream &operator>>(istream &is,Int &val){
  string s;
  is>>s;
  val=0;
  for(Int i=0;i<(Int)s.size();i++)
    if(isdigit(s[i])) val=val*10+s[i]-'0';
  if(s[0]=='-') val*=-1;
  return is;
}


//INSERT ABOVE HERE
signed main(){
  Int x;
  cin>>x;
  string b="FESTIVAL";
  using P = pair<Int, Int>;
  const Int E=1<<9;
  vector<P> v(E,P(0,1));
  for(Int k=1;k<7;k++){
    Int tmp=0;
    for(Int i=0;i<(Int)v.size();i++){
      if(v[i].first==k-1){
	tmp+=v[i].second;
	if(__builtin_popcountll(tmp)!=1) continue;
	v.emplace(v.begin()+i+1,P(k,tmp));
	if(tmp==1) v.emplace(v.begin()+i+1,P(k,tmp));
      }
    }
    //cout<<tmp<<endl;
    for(Int i=2;i<E;i++) v.push_back(P(k,tmp));
  }
  Int tmp=0;
  for(Int i=0;i<(Int)v.size();i++){
    if(v[i].first==6){
      tmp+=v[i].second;
      if(__builtin_popcountll(tmp)!=1) continue;
      //cout<<i<<" "<<tmp<<endl;
      if(x&tmp){
	v.emplace(v.begin()+i+1,P(7,tmp));
	x^=tmp;
      }
    }
  }
  //cout<<x<<endl;
  string s;
  for(Int i=0;i<(Int)v.size();i++)
    s.push_back(b[v[i].first]);
  cout<<s<<endl;
  return 0;
}