#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<(S)<<endl
#define ck(a,b) (0<=(a)&&(a)<b)
using namespace std;


int main(){
	string s;
	cin>>s;
	char now;
	bool flag=true;
	if(s.size()<=3){
		if(s!="mew") flag=false;
	}else{
		REP(i,1,(int)s.size()-1){
			if(now=='m'&&s[i]=='e'){
				now='e';
			}else if(now=='e'&&s[i]=='w'){
				s.erase(s.begin()+i);
				i--;
				s.erase(s.begin()+i);
				i--;
				s.erase(s.begin()+i);
				i=max(0,i-3);
				now=' ';
			}else if(s[i]=='m') now='m';
			else now=' ';
		}
		if(s!="mew") flag=false;
	}
	p(flag?"Cat":"Rabbit");
	return 0;
}
### Prompt

Develop a solution in Cpp to the problem described below:

Example

Input

mmemewwemeww


Output

Cat

### Response

```cpp
#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<(S)<<endl
#define ck(a,b) (0<=(a)&&(a)<b)
using namespace std;


int main(){
	string s;
	cin>>s;
	char now;
	bool flag=true;
	if(s.size()<=3){
		if(s!="mew") flag=false;
	}else{
		REP(i,1,(int)s.size()-1){
			if(now=='m'&&s[i]=='e'){
				now='e';
			}else if(now=='e'&&s[i]=='w'){
				s.erase(s.begin()+i);
				i--;
				s.erase(s.begin()+i);
				i--;
				s.erase(s.begin()+i);
				i=max(0,i-3);
				now=' ';
			}else if(s[i]=='m') now='m';
			else now=' ';
		}
		if(s!="mew") flag=false;
	}
	p(flag?"Cat":"Rabbit");
	return 0;
}
```