///Enta etfsh5t nseet el rank

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
        tree_order_statistics_node_update>;
#define pb push_back
#define F first
#define S second
#define f(i, a, b) for (int i = a; i < b; i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
//#define mp(x, y) make_pair(x, y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ull = unsigned long long;
using uint = uint32_t;
using ii = pair<int, int>;

const int N = 1e3 + 20, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);

const long double EPS = 1e-9;


void doWork() {
    const string S = "SATELLITE";
    int K;
    cin >> K;
    vector<int> dp(S.size() + 1);
    dp[S.size()] = 1;
    vector<int> vals;
    while (true) {
        for (int j = S.size() - 1; j > 0; --j) {
            f(k, 0, S.size())if (S[k] == S[j])
                    dp[k] = min(K + 1, dp[k] + dp[k + 1]);
        }
        if (dp[1] > K)break;
        vals.push_back(dp[1]);
    }

    for (int i = vals.size() - 1; i >= 0 && K > 0; --i) {
        while (K >= vals[i]) {
            cout << S[0];
            K -= vals[i];
        }
        cout << S.substr(1);
    }

}

int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE
    int t = 1;
//    cin >> t;
    while (t--)
        doWork();
    return 0;
}