#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;

int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    string S; cin >> S;
    if(S == "mew"){ cout << "Cat" << endl; return 0;}
    while(true){
        string T = S.substr(1,S.length()-2);
        size_t idx = T.find("mew");
        if(idx == string::npos){
            cout << "Rabbit" << endl;
            return 0;
        }
        T.erase(idx,3);
        S = S[0] + T + S[S.length()-1];
        if(S.length() <= 3){
            if(S == "mew"){
                cout << "Cat" << endl;
            }else{
                cout << "Rabbit" << endl;
            }
            break;
        }
    }
    return 0;
}


### Prompt

Generate a CPP solution to the following problem:

Example

Input

mmemewwemeww


Output

Cat

### Response

```cpp
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;

int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    string S; cin >> S;
    if(S == "mew"){ cout << "Cat" << endl; return 0;}
    while(true){
        string T = S.substr(1,S.length()-2);
        size_t idx = T.find("mew");
        if(idx == string::npos){
            cout << "Rabbit" << endl;
            return 0;
        }
        T.erase(idx,3);
        S = S[0] + T + S[S.length()-1];
        if(S.length() <= 3){
            if(S == "mew"){
                cout << "Cat" << endl;
            }else{
                cout << "Rabbit" << endl;
            }
            break;
        }
    }
    return 0;
}


```