#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <bitset>
   
using namespace std;
   
 
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define COPY(dest, src) memcpy(dest, src, sizeof(dest))
#define ten(n) ((long long)(1e##n))
#define bin(n) (1ull << (n))
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define revrep(i, n) for (int i = (n); i >= 0; --i)
#define pb push_back

template <class T> void chmax(T& a, const T& b) { a = max(a, b); }
template <class T> void chmin(T& a, const T& b) { a = min(a, b); }

template <class T> void uniq(T& c) { sort(c.begin(), c.end()); c.erase(unique(c.begin(), c.end()), c.end()); }
 
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }
  
template <class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p) { os << "( " << p.first << ", " << p.second << " )"; return os; }
  
template <class T> void print(T a, int n, const string& deli = " ", int br = 1) { for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } while (br--) cout << endl; }
template <class T> void print(const T& c, const string& deli = " ", int br = 1) { foreach (it, c) { cout << *it; if (++it != c.end()) cout << deli;--it; } while (br--) cout << endl; }
template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) {    if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }
   
template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }

void fix_pre(int n) { cout.setf(ios::fixed, ios::floatfield); cout.precision(10); }
void fast_io() { cin.tie(0); ios::sync_with_stdio(false); }
#define trace(x) (cout << #x << ": " << (x) << endl)
 
bool in_rect(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }


typedef long long ll;
typedef pair<int, int> pint;
 
// y(v): v>^<  y(^): ^>v<
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };

const double PI = acos(-1.0);



typedef vector<string> vs;

vs mat() { return vs(2, string(2, '@')); }
vs mat(char c) { return vs(2, string(2, c)); }

void print_cube(vs s)
{
    rep(i, 6)
        cout << s[i] << endl;
}


// 2*2
vs rotate_r(vs s)
{
    vs t = mat();
    t[0][1] = s[0][0];
    t[1][1] = s[0][1];
    t[1][0] = s[1][1];
    t[0][0] = s[1][0];
    return t;
}
// 2*2
vs rotate_l(vs s)
{
    rep(i, 3)
        s = rotate_r(s);
    return s;
}

vs get_up(vs s)
{
    vs up = mat();
    rep(i, 2) rep(j, 2)
        up[i][j] = s[i][j + 2];
    return up;
}
vs set_up(vs s, vs up)
{
    rep(i, 2) rep(j, 2)
        s[i][j + 2] = up[i][j];
    return s;
}

vs get_down(vs s)
{
    vs down = mat();
    rep(i, 2) rep(j, 2)
        down[i][j] = s[i + 4][j + 2];
    return down;
}
vs set_down(vs s, vs down)
{
    rep(i, 2) rep(j, 2)
        s[i + 4][j + 2] = down[i][j];
    return s;
}

vs get_left(vs s)
{
    vs left = mat();
    rep(i, 2) rep(j, 2)
        left[i][j] = s[i + 2][j];
    return left;
}
vs set_left(vs s, vs left)
{
    rep(i, 2) rep(j, 2)
        s[i + 2][j] = left[i][j];
    return s;
}

vs get_right(vs s)
{
    vs right = mat();
    rep(i, 2) rep(j, 2)
        right[i][j] = s[i + 2][j + 4];
    return right;
}
vs set_right(vs s, vs right)
{
    rep(i, 2) rep(j, 2)
        s[i + 2][j + 4] = right[i][j];
    return s;
}

vs get_front(vs s)
{
    vs front = mat();
    rep(i, 2) rep(j, 2)
        front[i][j] = s[i + 2][j + 2];
    return front;
}
vs set_front(vs s, vs front)
{
    rep(i, 2) rep(j, 2)
        s[i + 2][j + 2] = front[i][j];
    return s;
}

vs get_back(vs s)
{
    vs back = mat();
    rep(i, 2) rep(j, 2)
        back[i][j] = s[i + 2][j + 6];
    return back;
}
vs set_back(vs s, vs back)
{
    rep(i, 2) rep(j, 2)
        s[i + 2][j + 6] = back[i][j];
    return s;
}

vs front_to_right(vs s)
{
// up
    s = set_up(s, rotate_l(get_up(s)));
// down
    s = set_down(s, rotate_r(get_down(s)));

// rotate right
    for (int y = 2; y <= 3; ++y)
        rotate(s[y].begin(), s[y].begin() + 6, s[y].end());

    return s;
}
vs front_to_down(vs s)
{
    vs t(6, string(8, '.'));

// up -> front, front -> down
    rep(i, 4) rep(j, 2)
        t[i + 2][j + 2] = s[i][j + 2];

// back -> up
    rep(i, 2) rep(j, 2)
        t[i][j + 2] = s[2 + (i ^ 1)][6 + (j ^ 1)];

// left
    t = set_left(t, rotate_r(get_left(s)));

// right
    t = set_right(t, rotate_l(get_right(s)));

// down -> back
    rep(i, 2) rep(j, 2)
        t[i + 2][j + 6] = s[4 + (i ^ 1)][2 + (j ^ 1)];

    return t;
}

vs rotate_90(vs s)
{
    vs t = s;

// front
    t = set_front(t, rotate_r(get_front(t)));

// mawari
    t[2][4] = s[1][2];
    t[3][4] = s[1][3];

    t[4][3] = s[2][4];
    t[4][2] = s[3][4];

    t[3][1] = s[4][3];
    t[2][1] = s[4][2];

    t[1][2] = s[3][1];
    t[1][3] = s[2][1];

    return t;
}

vs F(vs s)
{
    return rotate_90(s);
}

vs L(vs s)
{
    vs t = front_to_right(s);
    t = rotate_90(t);
    rep(i, 3)
        t = front_to_right(t);
    return t;
}

vs R(vs s)
{
    vs t = s;
    rep(i, 3)
        t = front_to_right(t);
    t = rotate_90(t);
    return front_to_right(t);
}

vs B(vs s)
{
    vs t = s;
    rep(i, 2)
        t = front_to_right(t);
    t = rotate_90(t);
    rep(i, 2)
        t = front_to_right(t);
    return t;
}

vs U(vs s)
{
    vs t = front_to_down(s);
    t = rotate_90(t);
    rep(i, 3)
        t = front_to_down(t);
    return t;
}

vs D(vs s)
{
    vs t = s;
    rep(i, 3)
        t = front_to_down(t);
    t = rotate_90(t);
    return front_to_down(t);
}

typedef vs (*ff)(vs s);

vs num()
{
    vs s = mat();
    rep(i, 2) rep(j, 2)
        s[i][j] = '1' + i * 2 + j;
    return s;
}

vs init()
{
    vs s(6, string(8, '.'));
    s = set_front(s, mat('y'));
    s = set_up(s, mat('r'));
    s = set_left(s, mat('g'));
    s = set_right(s, mat('b'));
    s = set_back(s, mat('w'));
    s = set_down(s, mat('o'));
    return s;
}

int main()
{
    const char* plane = "FLRBUD";
    ff func[] = { F, L, R, B, U, D };

    vs cube = init();

    string s;
    cin >> s;
    rep(i, s.size())
    {
        int k = strchr(plane, s[i]) - plane;
        cube = func[k](cube);
    }

    print_cube(cube);
}

Measured memory_bytes: 1224