#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

string S;
ll p = 0;

bool parse() {
  if(p < S.length() && S[p] == 'm') {
    bool ok = true;
    p++;
    ok = parse() && ok;
    ok = S[p++] == 'e' && ok;
    ok = parse() && ok;
    ok = S[p++] == 'w' && ok;
    return ok;
  } else {
    return true;
  }
}

int main(void) {
  cin >> S;
  cout << (parse() && p == S.length() ? "Cat" : "Rabbit") << endl;
}


### Prompt

Create a solution in cpp for the following problem:

Example

Input

mmemewwemeww


Output

Cat

### Response

```cpp
#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

string S;
ll p = 0;

bool parse() {
  if(p < S.length() && S[p] == 'm') {
    bool ok = true;
    p++;
    ok = parse() && ok;
    ok = S[p++] == 'e' && ok;
    ok = parse() && ok;
    ok = S[p++] == 'w' && ok;
    return ok;
  } else {
    return true;
  }
}

int main(void) {
  cin >> S;
  cout << (parse() && p == S.length() ? "Cat" : "Rabbit") << endl;
}


```