#include <bits/stdc++.h>
#define fi first
#define se second
#define long long long
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
using namespace std;

typedef pair<long,long> ii;

template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}

template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}

const int TMP = 3000;
const int N = 2e5 + 5;
const int oo = 1e9;
const long ooo = 1e18;

string s = "SATELLITE";

long dp[5003][10];
vector<ii> coin;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    for(int i = TMP; i >= 1; i--)
    {
        int _i = (i%8 == 0)? 8 : (i%8);
        char c = s[_i];
        dp[i][8] += dp[i+1][8];
        if(c == s[8]) dp[i][8] += 1;
        for(int j = 1; j <= 7; j++)
        {
            dp[i][j] += dp[i+1][j];
            if(c == s[j])
            {
                dp[i][j] += dp[i+1][j+1];
            }
        
            if(dp[i][j] >= ooo) break;
        }
        if(c == 'A')
        {
            // cout <<  i << " " << dp[i][1] << "\n";
            coin.push_back({i, dp[i][1]});
        }
        if(dp[i][1] >= ooo) break;
    }
    reverse(coin.begin(), coin.end());
    long k; cin >> k;
    vector<int> ans;
    for(int j = 0; j < coin.size(); j++)
    {
        while(k >= coin[j].se)
        {
            k -= coin[j].se;
            ans.push_back(coin[j].fi);
        }
    }
    // cout << ans.size() << "\n";
    reverse(ans.begin(), ans.end());
    for(int i = 1; i <= TMP; i++)
    {
        while(ans.size() && ans.back() == i)
        {
            ans.pop_back();
            cout << "S";
        }
        int _i = (i%8 == 0)? 8 : (i%8);
        char c = s[_i];
        cout << c;
    }
    cout << '\n';
    // cout << "DONT FORGET TO CHANGE TMP\n";
    // for(int x : ans) cout << x << " "; cout << "\n";
}