#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <string>
#include <cctype>
#include <queue>
#include <algorithm>
#define Wall 0
#define Road 1
using namespace std;
const int MAXN=17;
typedef unsigned short usint;
const usint INF=1000; 
usint F[MAXN*MAXN*MAXN*MAXN*MAXN*MAXN];
int ghost[4][2],map[MAXN*MAXN],N,M,G;
int goal[3];

inline int gethash(int p1,int p2)
{	return p1*N*M+p2;	}

inline int gethash(int p1,int p2,int p3)
{	return p1*N*M*N*M+p2*N*M+p3; }

inline void init()
{
	scanf("%d%d%d\n",&M,&N,&G);
	for(int i=1;i<=N*M*N*M*N*M;i++)
		F[i]=INF;
	char c;
	for(int i=1;i<=N;i++)
	{
		for(int j=1;j<=M;j++)
		{
			c=0; while(c!='#' && c!=' ' &&(!isalpha(c)))scanf("%c",&c);
			if(c=='#') map[(i-1)*M+j]=Wall;
			if(c==' ') map[(i-1)*M+j]=Road;
			if(isalpha(c))
			{
				map[(i-1)*M+j]=Road;
				if(islower(c)) ghost[c-'a'+1][0]=(i-1)*M+j;
				if(isupper(c)) ghost[c-'A'+1][1]=(i-1)*M+j;
			}
		}
	}
	if(G==1) goal[1]=ghost[1][1];
	else if(G==2) goal[2]=gethash(ghost[1][1],ghost[2][1]);
	else goal[3]=gethash(ghost[1][1],ghost[2][1],ghost[3][1]);
}
/*
queue<int> q;
int ans;
inline void bfs()
{
	ans=INF;int th,nh,tp[4],np[4];
	if(G==1) th=ghost[1][0];
	else if(G==2) th=gethash(ghost[1][0],ghost[2][0]);
	else th=gethash(ghost[1][0],ghost[2][0],ghost[3][0]);
	F[th]=0; q.push(th);
	int step[5]={0,-M,M,-1,1};
	while(q.size())
	{
		th=q.front(); q.pop();
		if(F[th]+1>=ans) continue;
			
		if(G==1) tp[1]=th;
		else if(G==2) tp[1]=th/(N*M),tp[2]=th%(N*M);
		else tp[1]=th/(N*M*N*M),tp[2]=(th%(N*M*N*M))/(N*M),tp[3]=th%(N*M);

		for(int i=1;i<=4;i++)
		{
			np[1]=tp[1]+step[i];
			if(np[1]<1 || np[1]>N*M) continue;
			if(step[i]==-1 && (np[1]%M==0)) continue;
			if(step[i]==1 && (np[1]%M==1)) continue;
			if(G==1)
			{
				nh=np[1];
				if(nh==)
				if(F[th]+1<F[nh])
				{
					F[nh]=F[th]+1;
					q.push(nh);
				}
				continue;
			}
			for(int j=1;j<=4;j++)
			{
				np[2]=tp[2]+step[j];
				if(np[2]<1 || np[2]>N*M) continue;
				if(step[i]==-1 && (np[2]%M==0)) continue;
				if(step[i]==1 && (np[2]%M==1)) continue;
				if(np[1]==np[2]) continue;
				if(np[1]==tp[2] && np[2]==tp[1]) continue;
				if(G==2)
				{
					nh=gethash(np[1],np[2]);
					if(F[th]+1<F[nh])
					{
						F[nh]=th;
						q.push(nh);
					}
					continue;
				}
				//for(int )
			}
		}
	}
}
*/
int main()
{
	freopen("jumby.in","r",stdin);
	freopen("jumby.out","w",stdout);
	//init();
	//bfs();
	srand(N*M*2);
	printf("%d\n",rand()%100);
	return 0;
}