#include<iostream>

#include<cstring>

#include<algorithm>

#include<queue>

#include<cstdio>

#define MAX 322560

using namespace std;

struct Node

{

    int a[],g,h,num,Hash;

    friend bool operator<(const Node x,const Node y)

    {

        return x.h+x.g>y.h+y.g;

    }

}start;

int HASH[]={,,,,,,,,};

int vis[],pre[],dis[] = {-,-,,};

int a[][];

int get_Hash(Node x)

{

    int ans = ;

    for(int i = ;i < ;i++)

    {

        int k = ;

        for(int j =;j <i;j++)

        {

            if(x.a[j]>x.a[i])   k++;

        }

        ans += HASH[i]*k;

    }

    return ans;

}

int get_h(Node x)

{   //»ñµÃ¹À¼Ûº¯ÊýH

    int ans=;

    for(int i=;i<;i++)

    {

        if(x.a[i] == ) continue;

        ans += abs(i/-(x.a[i]-)/)+abs(i%-(x.a[i]-)%);

    }

    return ans;

}

void printff(int h)

{

    if(pre[h] == -)    return;

    printff(pre[h]);

    switch (vis[h])

    {

        case : printf("u");

                break;

        case : printf("l");

                break;

        case : printf("d");

                break;

        case : printf("r");

                break;

    }

}

int main()

{

    char str[];

    while(gets(str))

    {

        memset(vis,-,sizeof(vis));

        memset(pre,-,sizeof(pre));

        int now = ,num = ;

        for(int i = ;i < ;i++)

        {

            for(int j = ;j < ;j++,now++)

            {

                if(str[now] >= '' && str[now] <= '')

                {

                    start.a[num++] = str[now]-'';

                }

                else if(str[now] == 'x')

                {

                    start.num = num;

                    start.a[num++] = ;

                }

                else    j--;

            }

        }

        num = ;

        for(int i = ;i < ;i++)

        {

            for(int j = i+;j <;j++)

            {

                if(start.a[i] && start.a[j] && start.a[i]>start.a[j])   num++;

            }

        }

        if(num%)

        {

            printf("unsolvable\n");

            continue;

        }

        start.Hash = get_Hash(start);

        if(start.Hash == MAX)

        {

            printf("\n");

            continue;

        }

        start.g = ;

        start.h = get_h(start);

        vis[start.Hash] = -;

        priority_queue<Node> q;

        q.push(start);

        while(!q.empty())

        {

            Node temp = q.top();

            int xx = temp.num/,yy = temp.num%;

            q.pop();

            for(int i = ;i < ;i++)

            {

                Node x = temp;

                x.num += dis[i];

                if(yy ==  && i == )   continue;

                if(yy ==  && i == )   continue;

                if(x.num <  || x.num > )  continue;

                swap(x.a[x.num],x.a[temp.num]);

                x.Hash = get_Hash(x);

                if(vis[x.Hash] != -)   continue;

                x.g++;

                x.h = get_h(x);

                q.push(x);

                pre[x.Hash] = temp.Hash;

                vis[x.Hash] = i;

                if(x.Hash == MAX)   goto there;

            }

        }

        there:

        printff(MAX);

        printf("\n");

    }

}