#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<algorithm>

using namespace std;

//#define PRINTF(args...) printf(args)
#define PRINTF(args...) 

#define FOR(i,a,b) for(int i=(a); i<(int)(b); ++i)
#define FORD(i,a,b) for(int i=(a)-1; i>=(int)(b); --i)
#define FOREACH(i,C) for(__typeof(C.begin()) i=C.begin(); i!=C.end(); ++i)

int n;
char tab[42][42];
int dist[40][40][40][40];
int dp[1<<4];
int distP[40][40][4];

const int INF = 1000000;

int count(int x0, int y0, int x1, int y1) {
	if(x0>x1) {
		swap(x0,x1);
		swap(y0,y1);
	}
	int res  = x1-x0;
	int k = y1-y0;
	if(x0<n) {
		if(x1<n) {
			if(k<0)
				res -= k; else if(k>res)
				res = k;
		} else {
			if(x1+k<n-1)
				res += (n-1)-(x1+k);
			if(k>n-x0)
				res += k-n+x0;
		}
	} else {
		if(k>0)
			res += k; else if(-k>res)
			res = -k;
	}
	res--;
	return max(0,res);
}

int bitCount(int k) {
	int res = 0;
	while(k) {
		res += k%2;
		k /= 2;
	}
	return res;
}

bool testcase() {

	scanf("%d",&n);
	if(n==0)
		return false;
		
	PRINTF("n=%d\n",n);
		
	FOR(i,0,(2*n-1)) {
		int j=0;
		while(true) {
			char c;
			scanf("%c",&c);
			if(c=='\n') {
				if(j>0)
					break;
			} else if(c=='.' || (c<='D' && c>='A'))
				tab[i][j++] = c;
			PRINTF("%d %c\n",j,c);
		}
		tab[i][j++] = 0;
		PRINTF("%d %s\n",i,tab[i]);
	}

		
	FOR(i,0,(1<<4))
		dp[i] = INF;
	
	FOR(a,0,(2*n-1)) {
		int bA = 2*n-1-abs(n-(a+1));
		FOR(b,0,bA) FOR(i,0,4)
			distP[a][b][i] = INF;
	}
	
	FOR(i,0,(2*n-1)) {
		int bI = 2*n-1-abs(n-(i+1));
		FOR(j,0,bI) FOR(a,0,(2*n-1)) {
			int bA = 2*n-1-abs(n-(a+1));
			FOR(b,0,bA) {
				int nI = tab[i][j]-'A', nA=tab[a][b]-'A';
				if(nI>=0 && nI<=3 && nA>=0 && nA<=3)
					dp[(1<<nI)||(1<<nA)] <?= dist[i][j][a][b]; else if(nI>=0 && nI<=3)
					distP[a][b][nI] <?= dist[i][j][a][b]; else if(nA>=0 && nA<=3)
					distP[i][j][nA] <?= dist[i][j][a][b];
			}
		}
	}
	
	FOR(i,0,(2*n-1)) {
		int bI = 2*n-1-abs(n-(i+1));
		FOR(j,0,bI) if(tab[i][j]=='.') {
			FOR(mask,0,(1<<4)) {
				int count = 0, val=1;
				FOR(a,0,4) if(mask&(1<<a)) {
					count++;
					val += distP[i][j][a];
				}
				if(count==3)
					dp[mask] <?= val;
			}
			
			FOR(a,0,(2*n-1)) {
				int bA = 2*n-1-abs(n-(a+1));
				FOR(b,0,bA) if(tab[a][b]=='.') FOR(mask,0,(1<<4)) {
					int count = 0, val=2;
					FOR(k,0,4) if(mask&(1<<k)) {
						count++;
						val += distP[i][j][k];
					} else 
						val += distP[a][b][k];
					if(count==2)
						dp[(1<<4)-1] <?= val;
				}
			}
		}
	}
	
	FOR(i,0,(1<<4)) FOR(j,0,(1<<4)) if((i&j)==0 && bitCount(i)>=2 && bitCount(j)>=2)
		dp[i] <?= dp[j] + dp[i-1];
		
	printf("You have to buy %d parcels.\n",dp[(1<<4)-1]);
	
	return true;
}

int main() {
	FOR(i,0,40) FOR(j,0,40) FOR(a,i,40) FOR(b,0,40)
		dist[i][j][a][b] = dist[a][b][i][j] = count(i,j,a,b);
	while(testcase());
	return 0;
}