import java.io.*;
import java.util.*;

public class PixelShuffle_nomura{
	static int gcd(int a,int b){
		return b==0 ? a : gcd(b,a%b);
	}
	static int lcm(int a,int b){
		return a/gcd(a,b)*b;
	}
	
	public static void main(String[] args) throws Exception{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		int i,j,k,l;
		
		while(true){
			int n=Integer.parseInt(br.readLine());
			if(n==0) break;
			
			int[][] trans=new int[n][n];
			for(i=0;i<n;i++)
				for(j=0;j<n;j++) trans[i][j]=i*n+j;
			
			st=new StringTokenizer(br.readLine());
			while(st.hasMoreTokens()){
				String key=st.nextToken();
				
				int[][] tmp=new int[n][n];
				
				if     (key.equals("rot"))
					for(i=0;i<n;i++)
						for(j=0;j<n;j++) tmp[i][j]=trans[j][n-1-i];
				else if(key.equals("rot-"))
					for(i=0;i<n;i++)
						for(j=0;j<n;j++) tmp[i][j]=trans[n-1-j][i];
				else if(key.equals("sym") || key.equals("sym-"))
					for(i=0;i<n;i++)
						for(j=0;j<n;j++) tmp[i][j]=trans[n-1-i][j];
				else if(key.equals("bhsym") || key.equals("bhsym-"))
					for(i=0;i<n;i++){
						for(j=0;j<n/2;j++) tmp[i][j]=trans[i][j];
						for(j=n/2;j<n;j++) tmp[i][j]=trans[n-1-i][j];
					}
				else if(key.equals("bvsym") || key.equals("bvsym-"))
					for(i=0;i<n;i++){
						for(j=0;j<n/2;j++) tmp[i][j]=trans[i][j];
						for(j=n/2;j<n;j++) tmp[i][j]=trans[i][n-1-(j-n/2)];
					}
				else if(key.equals("div"))
					for(i=0;i<n;i++){
						for(j=0;j<n;j+=2) tmp[i][j]=trans[i][j/2];
						for(j=1;j<n;j+=2) tmp[i][j]=trans[i][n/2+(j-1)/2];
					}
				else if(key.equals("div-"))
					for(i=0;i<n;i++){
						for(j=0;j<n/2;j++) tmp[i][j]=trans[i][2*j];
						for(j=n/2;j<n;j++) tmp[i][j]=trans[i][2*(j-n/2)+1];
					}
				else if(key.equals("mix"))
					for(j=0;j<n;j+=2){
						for(i=0;i<n  ;i++) tmp[i%n][j+i/n]=trans[2*i%n][j+2*i/n];
						for(i=n;i<2*n;i++) tmp[i%n][j+i/n]=trans[(2*(i-n)+1)%n][j+(2*(i-n)+1)/n];
					}
				else if(key.equals("mix-"))
					for(j=0;j<n;j+=2){
						for(i=0;i<2*n;i+=2) tmp[i%n][j+i/n]=trans[i/2%n][j+i/2/n];
						for(i=1;i<2*n;i+=2) tmp[i%n][j+i/n]=trans[(n+(i-1)/2)%n][j+(n+(i-1)/2)/n];
					}
				else continue;
				
				trans=tmp;
			}
			
			int ans=1;
			boolean[][] checked=new boolean[n][n];
			for(i=0;i<n;i++){
				for(j=0;j<n;j++){
					int loop=0;
					for(int pos=i*n+j;!checked[pos/n][pos%n];pos=trans[pos/n][pos%n]){
						loop++;
						checked[pos/n][pos%n]=true;
					}
					
					if(loop!=0) ans=lcm(ans,loop);
				}
			}
			
			System.out.println(ans);
		}
	}
}