#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


// const string COMMANDS = "e><+-oi[]d";

// 4
/*
+>+
[
  >i+
]
<-<-
d
[
  ->>
  + [->>>>+<<<<[->>>>+<<<<[->>>>+<<<<[->>>>[-]<<<<]]]] >>>>[-<<<<+>>>>]<<<<
  + [->>>>+<<<<[->>>>+<<<<[->>>>+<<<<[->>>>[-]<<<<]]]] >>>>[-<<<<+>>>>]<<<<
  <<
  d
]
>
[
  ->
  + [->>>>+<<<<[->>>>+<<<<[->>>>+<<<<[->>>>[-]<<<<]]]] >>>>[-<<<<+>>>>]<<<<
  <
  d
]
>
[
  >oe
]
+oe
*/

// 5
/*
+>+
[
  >i+
]
<-<-
d
[
  ->>
  <<
  d
]
>
[
  ->
  + [->>>>+<<<<[->>>>+<<<<[->>>>+<<<<[->>>>+<<<<[->>>>[-]<<<<]]]]] >>>>[-<<<<+>>>>]<<<<
  <
  d
]
>
[
  >oe
]
+oe
*/

const string ANS[7] ={
"?",
"UCCAGGUACUGUUGCGCGCCC",
"UGCAGGUACACGAGGUACUGUUGAAGGUACACGUGCUGAUGUUCCUGCUGUACGUGCAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGUGUUGUUGUUGUUGUUGUUGUUGUUGUUGUUGAGCGCCC",
"UGCAGGACGACGUCCAGGUACACGUGCACGUGCUGAUGAUGUACGACGACGUGCUGAUGCAGGUACACGAGGUACUGUUGAUGUACGAGGUGAUGAUGAUGCUGAAGGUACACGAGGUACUGUUGAUGUACGGCGCCCUGUUGAUGAAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGUGUUGUUGUUGUUGUUGUUGUUGUUGUUGAAGGUACUGAUGCACGUGUUGAAGGUACACGUGCUGAAGGUACACGUGCUGAAGGUACACGUACUACUGAAGGUACACGUGCUGAUGUUGUUGUUGUACGAGGUACUGAUGCACGUGUUGAUGAUGU",

// 4
"UGCACGUGCAGGACGUCCUGCUGUUGAUACUGAUACAGGUACACGACGUGCAGGUACACGACGACGACGUGCUGAUGAUGAUGAAGGUACACGACGACGACGUGCUGAUGAUGAUGAAGGUACACGACGACGACGUGCUGAUGAUGAUGAAGGUACACGACGACGACGAGGUACUGUUGAUGAUGAUGAUGUUGUUGUUGUACGACGACGACGAGGUACUGAUGAUGAUGAUGCACGACGACGACGUGUUGAUGAUGAUGAUGCAGGUACACGACGACGACGUGCUGAUGAUGAUGAAGGUACACGACGACGACGUGCUGAUGAUGAUGAAGGUACACGACGACGACGUGCUGAUGAUGAUGAAGGUACACGACGACGACGAGGUACUGUUGAUGAUGAUGAUGUUGUUGUUGUACGACGACGACGAGGUACUGAUGAUGAUGAUGCACGACGACGACGUGUUGAUGAUGAUGAUGAUGAUGUACGAGGUACACGUGCAGGUACACGACGACGACGUGCUGAUGAUGAUGAAGGUACACGACGACGACGUGCUGAUGAUGAUGAAGGUACACGACGACGACGUGCUGAUGAUGAUGAAGGUACACGACGACGACGAGGUACUGUUGAUGAUGAUGAUGUUGUUGUUGUACGACGACGACGAGGUACUGAUGAUGAUGAUGCACGACGACGACGUGUUGAUGAUGAUGAUGAUGUACGAGGACGGCGCCCUGUUGCGCGCCC",
// 5
"UGCACGUGCAGGACGUCCUGCUGUUGAUACUGAUACAGGUACACGACGUGAUGAUGUACGAGGUACACGUGCAGGUACACGACGACGACGUGCUGAUGAUGAUGAAGGUACACGACGACGACGUGCUGAUGAUGAUGAAGGUACACGACGACGACGUGCUGAUGAUGAUGAAGGUACACGACGACGACGUGCUGAUGAUGAUGAAGGUACACGACGACGACGAGGUACUGUUGAUGAUGAUGAUGUUGUUGUUGUUGUACGACGACGACGAGGUACUGAUGAUGAUGAUGCACGACGACGACGUGUUGAUGAUGAUGAUGAUGUACGAGGACGGCGCCCUGUUGCGCGCCC",

"UGCAGGACGACGUCCAGGUACACGUGCACGUGCUGAUGAUGUACGACGACGUGCUGAUGCAGGUACACGAGGUACUGUUGAUGUACGAGGUGAUGAUGAUGAAGGAGGUACUGUGCGCCCUGUACGACGACGACGACGACGUGCAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGAGGUACUGAUGCACGAGGUACUGAUACACGUGUUGUUGUUGUUGUUGUUGUUGUUGUUGUUGAGCGCCCUGUUGAACGACGAGGUACUGUACGAGGUACUGUUGAUGAUGAUGAAGGUACACGACGACGUGCACGUGCUGAUGAUGAUGAUGUACGACGACGAGGUACUGAUGAUGAUGCACGACGACGUGUUGAUGAUGAAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGAGGUACUGAUGCACGAGGUACUGAUGCACGAGGUACUGAUACUACACGUGUUGUUGUUGUUGUUGUUGUUGUUGUUGAAGGUACUGAUGCACGUGUUGAAGGUACACGUGCUGAAGGUACACGUGCUGAAGGUACACGUACUACUGAAGGUACACGUGCUGAUGUUGUUGUUGUACGAGGUACUGAUGCACGUGUUGAUGAUGU",
};

int main() {
  int K;
  scanf("%d", &K);
  puts(ANS[K].c_str());
  return 0;
}