#include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(),(c).end())

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

using namespace std;
string s;
int i;
bool solve(void)
{
  if(i>=s.size()) return false;
  if(s[i]=='m'){
    ++i;
    if(!solve()) return false;
    if(i>=s.size()) return false;
    if(s[i]=='e'){
      ++i;
      if(!solve()) return false;
      if(i>=s.size()) return false;
      if(s[i]=='w'){
	++i;
	return true;
      }
    }
  }else return true;
}
int main(void)
{
  cin >> s;
  i=0;
  if(solve()&&i==s.size()) cout << "Cat" << endl;
  else cout << "Rabbit" << endl;
  return 0;
}
### Prompt

Your task is to create a CPP solution to the following problem:

Example

Input

mmemewwemeww


Output

Cat

### Response

```cpp
#include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(),(c).end())

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

using namespace std;
string s;
int i;
bool solve(void)
{
  if(i>=s.size()) return false;
  if(s[i]=='m'){
    ++i;
    if(!solve()) return false;
    if(i>=s.size()) return false;
    if(s[i]=='e'){
      ++i;
      if(!solve()) return false;
      if(i>=s.size()) return false;
      if(s[i]=='w'){
	++i;
	return true;
      }
    }
  }else return true;
}
int main(void)
{
  cin >> s;
  i=0;
  if(solve()&&i==s.size()) cout << "Cat" << endl;
  else cout << "Rabbit" << endl;
  return 0;
}
```