#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <limits>
#include <cmath>
#include <cstdio>
#include <vector>
#include <queue>

#define DEBUG

#ifdef DEBUG
	#define DBG if (1)
#else
	#define DBG if (0)
#endif

#define PA(arr, n) DBG for (int i = 0; i < n; i++) printf("%d%c", arr[i], "\n "[i < n - 1])
#define PD(n) DBG printf("%d\n", n); 
#define PDBL(n) DBG printf("%lf\n", n);

using namespace std;

int main () {

	int s;
	char k;
	while(scanf("%d %c", &s, &k) == 2){
		if(k == 'R' || k == 'B'){
			printf("%d\n",s);
			continue;		
		}	
		if(k == 'K'){
			printf("%d\n",(s==1)?1:4);
			continue;
		}
		if(k == 'N'){
			if( s <=2)
				printf("1\n");

			else printf("2\n");
		}
	}


	return 0;

}