#include <bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int N = 300500, inf = 1e9, mod = 998244353;
const ll INF = 1e18;

int sum(int a, int b) {
    a += b;
    if (a >= mod)
        a -= mod;
    return a;
}

int sub(int a, int b) {
    a -= b;
    if (a < 0)
        a += mod;
    return a;
}

int mult(int a, int b) {
    return 1ll * a * b % mod;
}

int bp(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1)
            res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int inv(int x) {
    return bp(x, mod - 2);
}

string TARGET = "SATELLITE";
vector<char> mhq = {'A', 'T', 'E', 'L', 'I'};

string s;
ll dp[N][20];

string ANS;

void solve() {
    while (s.size() <= 3400)
        s += mhq[rand() % mhq.size()];
    s += "ATELLITE";

    dp[s.size()][TARGET.size()] = 1;

    for (int i = s.size() - 1; i >= 0; i--) {
        for (int j = 0; j <= TARGET.size(); j++)
            dp[i][j] = dp[i + 1][j];
        for (int j = 0; j < TARGET.size(); j++)
            if (s[i] == TARGET[j])
                dp[i][j] += dp[i + 1][j + 1];
        for (int j = 0; j <= TARGET.size(); j++)
            if (dp[i][j] >= 2 * INF)
                dp[i][j] = 2 * INF;
    }
    ll k;
    cin >> k;
    for (int i = 0; i < s.size(); i++) {
        while (k > 0 && k >= dp[i][1]) {
            ANS += 'S';
            k -= dp[i][1];
        }
        ANS += s[i];
    }
    cout << ANS << "\n";
}

int main() {
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout << "Case #" << i << endl;
        solve();
    }
}