// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
const char cc[] = {'L', 'R', 'U', 'D'};
const int xx[] = {-1, +1, 0, 0},
          yy[] = {0, 0, +1, -1};
int n, a[20];
std::set<std::pair<int, int>> ans;
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n;
    for (int i = 0; i != n; ++i)
    {
        static char s;
        std::cin >> s;
        a[i] = std::find(cc, cc + 4, s) - cc;
    }
    for (int i = 0; i != 1 << n; ++i)
    {
        std::map<std::pair<int, int>, bool> map;
        int cx = 0, cy = 0;
        map.insert({{cx, cy}, true});
        bool flag = true;
        for (int j = 0; j != n; ++j)
            if (i >> j & 1)
                flag &= map.insert({{cx += xx[a[j]], cy += yy[a[j]]}, true}).first->second;
            else
                flag &= !map.insert({{cx + xx[a[j]], cy + yy[a[j]]}, false}).first->second;
        if (flag)
            ans.insert({cx, cy});
    }
    std::cout << ans.size() << std::endl;
    for (auto i : ans)
        std::cout << i.first << ' ' << i.second << std::endl;
    return 0;
}