#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;


int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);

/*
CCC 0 STOP
ACG 1 NEXT
UGA 2 PREV
UGC 3 INC
UAC 4 DEC
GCG 5 OUT
UCC 6 IN
AGG 7 BEGIN
UGU 8 END
CAC 9 (DEBUG)
*/

  vector<string> codes = {"STOP", "NEXT", "PREV", "INC", "DEC", "OUT", "IN", "BEGIN", "END", "DEBUG"};
  vector<string> nucl = {"CCC", "ACG", "UGA", "UGC", "UAC", "GCG", "UCC", "AGG", "UGU", "CAC"};
  map<string, int> to_id;
  for (int i = 0; i < 10; ++i)
    to_id[codes[i]] = i;

  auto op = [&](string s) {
    if (!to_id.count(s))
      assert(false);
    return to_id[s];
  };

  auto case_digits = [&](vector<vector<int>> to_do) {
    vector<int> ans;
    ans.emplace_back(op("BEGIN"));
    for (int i = 0; i < 8; ++i) {
      ans.emplace_back(op("DEC"));
      ans.emplace_back(op("BEGIN"));
    }
    for (int i = 9; i >= 0; --i) {
      for (int x : to_do[i])
        ans.emplace_back(x);
      ans.emplace_back(op("END"));
    }
    ans.pop_back();
    return ans;
  };
  
  int k;
  cin >> k;
  if (k == 1) {
    cout << "UCCAGGUACUGUUGCGCGCCC";
  } else if (k == 2) {
    cout << "UGCAGGUACACGAGGUACUGUUGAAGGUACACGUGCUGAUGUUCCUGCUGUACGUGCAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGUGUUGUUGUUGUUGUUGUUGUUGUUGUUGUUGAGCGCCC";
  } else if (k == 3) {
    cout << "UGCAGGACGACGUCCAGGUACACGUGCACGUGCUGAUGAUGUACGACGACGUGCUGAUGCAGGUACACGAGGUACUGUUGAUGUACGAGGUGAUGAUGAUGCUGAAGGUACACGAGGUACUGUUGAUGUACGGCGCCCUGUUGAUGAAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGUGUUGUUGUUGUUGUUGUUGUUGUUGUUGAAGGUACUGAUGCACGUGUUGAAGGUACACGUGCUGAAGGUACACGUGCUGAAGGUACACGUACUACUGAAGGUACACGUGCUGAUGUUGUUGUUGUACGAGGUACUGAUGCACGUGUUGAUGAUGU";
  } else if (k == 4) {
    vector<int> ans = {op("INC"), op("BEGIN"), op("NEXT"), op("IN"), op("INC"), op("END"), op("PREV"), op("DEC")};
    vector<int> win = {op("NEXT"), op("NEXT"), op("INC"), op("OUT"), op("STOP")};
    vector<int> lose = {op("NEXT"), op("NEXT"), op("OUT"), op("STOP")};
    vector<vector<int>> to_do(10);
    for (int i = 0; i < 10; ++i) {
      vector<int> cur = {op("PREV"), op("DEC")};
      vector<vector<int>> cur_to_do(10);
      for (int j = 0; j < 10; ++j) {
        if ((j * 10 + i) % 4 == 0)
          cur_to_do[j] = win;
        else
          cur_to_do[j] = lose;
      }
      auto cur_rest = case_digits(cur_to_do);
      for (int x : cur_rest)
        cur.emplace_back(x);
      to_do[i] = cur;
    }
    auto rest = case_digits(to_do);
    for (int x : rest)
      ans.emplace_back(x);
    for (int i : ans)
      cout << nucl[i];
  } else if (k == 5) {
    vector<int> ans = {op("IN"), op("INC"), op("BEGIN"), op("NEXT"), op("IN"), op("INC"), op("END"), op("PREV"), op("DEC")};
    vector<int> win = {op("NEXT"), op("INC"), op("OUT"), op("STOP")};
    vector<int> lose = {op("NEXT"), op("OUT"), op("STOP")};
    vector<vector<int>> to_do(10);
    for (int i = 0; i < 10; ++i) {
      if (i % 5 == 0)
        to_do[i] = win;
      else
        to_do[i] = lose;
    }
    auto rest = case_digits(to_do);
    for (int x : rest)
      ans.emplace_back(x);
    for (int i : ans)
      cout << nucl[i];
  } else {
    cout << "UGCAGGACGACGUCCAGGUACACGUGCACGUGCUGAUGAUGUACGACGACGUGCUGAUGCAGGUACACGAGGUACUGUUGAUGUACGAGGUGAUGAUGAUGAAGGAGGUACUGUGCGCCCUGUACGACGACGACGACGACGUGCAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGUGUUGUUGUUGUUGUUGUUGUUGUUGUUGUUGAGCGCCCUGUUGAACGACGAGGUACUGUACGAGGUACUGUUGAUGAUGAUGAAGGUACACGACGACGUGCACGUGCUGAUGAUGAUGAUGUACGACGACGAGGUACUGAUGAUGAUGCACGACGACGUGUUGAUGAUGAAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGUGUUGUUGUUGUUGUUGUUGUUGUUGUUGAAGGUACUGAUGCACGUGUUGAAGGUACACGUGCUGAAGGUACACGUGCUGAAGGUACACGUACUACUGAAGGUACACGUGCUGAUGUUGUUGUUGUACGAGGUACUGAUGCACGUGUUGAUGAUGU";
  }
  cout << '\n';

  /*int n;
  cin >> n;
  cout << n << '\n';*/
  return 0;
}