#include <cstdio>
#include <queue>
#include <string>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN=25;
int Move[8][7]={
{0,2,6,11,15,20,22},
{1,3,8,12,17,21,23},
{10,9,8,7,6,5,4},
{19,18,17,16,15,14,13},
{23,21,17,12,8,3,1},
{22,20,15,11,6,2,0},
{13,14,15,16,17,18,19},
{4,5,6,7,8,9,10}
};
int Center[10]={6,7,8,11,12,15,16,17};
class QUEUE
{
public:
	int num[MAXN];
	vector<int> move;
	void clear()
	{
		memset(num,0,sizeof(num));
		move.clear();
	}
}Start,End;
int Num[MAXN];

int main()
{
	int endline;
	freopen("rotationa.in","r",stdin);
	freopen("rotationa.out","w",stdout);
	while(1)
	{
		cin>>endline;
		if(endline==0) exit(0);
		Start.clear();End.clear();
		Start.num[1]=endline;
		for(int i=2;i<=24;i++) cin>>Start.num[i];
		cout<<"No moves needed"<<endl;	
	}
	
	return 0;
}