1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000007LL
/*
#define G "G"
#define D "D"
#define L "L"
#define P "P"
#define SG "^"
#define SD "v"
*/
#define G "F"
#define D "C"
#define L "D"
#define P "A"
#define SG "E"
#define SD "B"

using namespace std;

long long n, m, a;
string c[] = {"0", "1", "2", "3", "4", "5", "6", "7", "8", "9"};

string powtorz(long long k, string str)
{
    if(k == 0)
        return "";
    if(k == 1)
        return str;
    FORD(i, 9, 2)
        if(k%i == 0)
            return c[i] + '[' + powtorz(k/i, str) + ']';
    return c[9] + '[' + powtorz(k/9, str) + ']' + powtorz(k%9, str);
}

string kwadrat(long long k)
{
    string str;
    string raz = powtorz(k-1, str + SD + L) + SD + powtorz(k, G);
    return powtorz(k, L) + powtorz(k, raz);
}

string trojkat(long long k)
{
    if(k == 1)
        return SG;
    if(k%2 == 0)
    {
        string str;
        return str + SG + D + trojkat(k-1) + powtorz(k-2, str + P + D) + P + powtorz(k-1, SG);
    }
    else
    {
        string str;
        return str + SG + D + powtorz(2, trojkat(k/2)) + powtorz(k/2, str + P + D)  + kwadrat(k/2) + powtorz(k/2-1, str + P + D) + P + powtorz(k-1, SG);
    }
}

int solve()
{
    cin >> n;
    string res = trojkat(n) + powtorz(n, D) + powtorz(n, P);
    cout << res << '\n';
    //cout << res.size() << '\n';

    return 0;
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return 0;
}