#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<sstream>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<string>
#include<deque>
#include<stack>
#include<cmath>
#include<queue>
#include<set>
#include<map>
using namespace std;
#define INF 0x3f3f3f3f
#define CLR(x,y) memset(x,y,sizeof(x))
#define LC(x) (x<<1)
#define RC(x) ((x<<1)+1)
#define MID(x,y) ((x+y)>>1)
typedef pair<int,int> pii;
typedef long long LL;
const double PI=acos(-1.0);
const int N=40320+10;
int fact[9]={1,1,2,6,24,120,720,5040,40320};
struct info
{
	int arr[8];
	int val;
	string step;
	void cantor()
	{
		val=0;
		for (int i=0; i<8; ++i)
		{
			int k=0;
			for (int j=i+1; j<8; ++j)
			{
				if(arr[j]<arr[i])
					++k;
			}
			val+=k*fact[7-i];
		}
	}
	void change_A()
	{
		reverse(arr,arr+8);
		step+="A";
	}
	void change_B()
	{
		int temp=arr[3];
		for (int i=3; i>0; --i)
			arr[i]=arr[i-1];
		arr[0]=temp;
		
		temp=arr[4];
		for (int i=4; i<7; ++i)
			arr[i]=arr[i+1];
		arr[7]=temp;
		step+="B";
	}
	void change_C()
	{
		int temp=arr[2];
		arr[2]=arr[1];
		arr[1]=arr[6];
		arr[6]=arr[5];
		arr[5]=temp;
		step+="C";
	}
};
info S,T;
char s[10];
int vis[N];
string ans[N];
int refl[10];
void bfs()
{
	CLR(vis,0);
	queue<info>Q;
	vis[S.val]=1;
	Q.push(S);
	info now,v;
	while (!Q.empty())
	{
		now=Q.front();
		Q.pop();
		int len=(int)now.step.length();
		if(len<1||now.step[len-1]!=‘A‘)
		{
			v=now;
			v.change_A();
			v.cantor();
			if(!vis[v.val])
			{
				vis[v.val]=1;
				ans[v.val]=v.step;
				Q.push(v);
			}
		}
		if(len<3||now.step[len-1]!=‘B‘||now.step[len-2]!=‘B‘||now.step[len-3]!=‘B‘)
		{
			v=now;
			v.change_B();
			v.cantor();
			if(!vis[v.val])
			{
				vis[v.val]=1;
				ans[v.val]=v.step;
				Q.push(v);
			}
		}
		if(len<3||now.step[len-1]!=‘C‘||now.step[len-2]!=‘C‘||now.step[len-3]!=‘C‘)		
		{
			v=now;
			v.change_C();
			v.cantor();
			if(!vis[v.val])
			{
				vis[v.val]=1;
				ans[v.val]=v.step;
				Q.push(v);
			}
		}
	}
}
int main(void)
{
	int i;
	for (i=0; i<8; ++i)
		S.arr[i]=i+1;
	S.cantor();
	
	bfs();
	
	while (~scanf("%s",s))
	{
		for (i=0; i<8; ++i)
			refl[s[i]-‘0‘-1]=i+1;
				
		scanf("%s",s);
		for (i=0; i<8; ++i)
			T.arr[i]=refl[s[i]-‘0‘-1];
		T.cantor();
		
		printf("%s\n",ans[T.val].c_str());
	}
	return 0;
}