#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <functional>
#include <map>
#include <set>
#include <tuple>
#include <iomanip>
#include <math.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#define INF 1<<30
#define md 998244353
template<typename T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
vector<bool> seen;
void dfs(const vector<vector<ll>>& a, int v) {
    seen[v] = true;

    fore(next_v, a[v]) {
        if (seen[next_v]) continue;
        dfs(a, next_v);
    }
}
vector<int> bfs(const Graph& G, int s) {
    int N = (int)G.size();

    vector<int> dist(N, -1);
    queue<int> que;

    dist[s] = 0;
    que.push(s);

    //BFSŠJŽn
    while (!que.empty()) {
        int v = que.front();
        que.pop();

        fore(x, G[v]) {
            if (dist[x] != -1) continue;
            dist[x] = dist[v] + 1;
            que.push(x);
        }
    }

    return dist;
}

int main() {
    //Step1
    int n; cin >> n;

    //Step2


    //Step3
    rep(i, 0, n) cout << "Long";

    return 0;
}