#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reg(i,a,b) for(int i=(a);i<=(b);i++)
#define irep(i,n) for(int i=((int)(n))-1;i>=0;i--)
#define ireg(i,a,b) for(int i=(b);i>=(a);i--)
typedef long long int lli;
typedef pair<int,int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX

char s[505];

bool expr(int& p){
	bool res = true;
	if(s[p]!='m')return false;
	p++;
	
	if(s[p]!='e'){
		res &= expr(p);
	}
	if(s[p]=='e')p++;
	else return false;
	
	if(s[p]!='w'){
		res &= expr(p);
	}
	if(s[p]=='w')p++;
	else return false;
	
	return res;
}

int main(void){
	scanf("%s",s);
	int p = 0;
	if((!expr(p)) || p!=strlen(s))printf("Rabbit\n");
	else printf("Cat\n");
	return 0;
}
### Prompt

Please provide a Cpp coded solution to the problem described below:

Example

Input

mmemewwemeww


Output

Cat

### Response

```cpp
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reg(i,a,b) for(int i=(a);i<=(b);i++)
#define irep(i,n) for(int i=((int)(n))-1;i>=0;i--)
#define ireg(i,a,b) for(int i=(b);i>=(a);i--)
typedef long long int lli;
typedef pair<int,int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX

char s[505];

bool expr(int& p){
	bool res = true;
	if(s[p]!='m')return false;
	p++;
	
	if(s[p]!='e'){
		res &= expr(p);
	}
	if(s[p]=='e')p++;
	else return false;
	
	if(s[p]!='w'){
		res &= expr(p);
	}
	if(s[p]=='w')p++;
	else return false;
	
	return res;
}

int main(void){
	scanf("%s",s);
	int p = 0;
	if((!expr(p)) || p!=strlen(s))printf("Rabbit\n");
	else printf("Cat\n");
	return 0;
}
```