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

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const string t = "SATELLITE";

LL f(const string& s) {
	vector<LL> dp(SZ(t) + 1);
	dp[0] = 1;
	FOR(i, 0, SZ(s)) {
		RFOR(j, SZ(t), 0) {
			if (t[j] == s[i]) {
				dp[j + 1] += dp[j];
			}
		}
	}
	return dp.back();
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	LL k;
	cin >> k;
	string s;
	vector<LL> cost;
	int c = 0;
	while (true) {
		LL cur = f(s + t);
		if (cur > k) {
			break;
		}
		s += t;
		c++;
		cost.push_back(f('S' + s) - cur);
	}
	reverse(ALL(cost));
	k -= f(s);
	vector<int> cnt(SZ(cost));
	FOR(i, 0, SZ(cost)) {
		while (k >= cost[i]) {
			k -= cost[i];
			cnt[i]++;
		}
	}
	int len = 0;
	FOR(i, 0, SZ(cost)) {
		FOR(j, 0, cnt[i]) {
			cout << 'S';
			len++;
		}
		cout << t;
		len += SZ(t);
	}
	assert(len <= 5000);
	cout << "\n";
	return 0;
}