#include<bits/stdc++.h> 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define ordered_multiset tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define pb push_back
#define ff first
#define ss second

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

    uint64_t x[12]={
        0x22ae9e9ad091bb3a,
        0xd5c31f1ee7e1fa8f,
        0xf807b7be20823557,
        0x3895af80e9d30069,
        0x4ee4094aa1e24bd7,
        0x8c16a64a18f86808,
        0x3039cd7b474ba8b0,
        0xfe2d787b8c006d3e,
        0xff181690f51f2a88,
        0xf7bada9bf702ef34,
        0xb9d0957d285954c0,
        0xfb2a014af878c4d6
    };

    mt19937 rng(5489);

    for(int i = 0; i < 12; i++){
        cout << char((x[i]&((1ll << 33) - 1))^rng());
        cout << char((x[i] >> 32) ^ rng());
    }

    return 0;
}