#include<iostream>
#include<cstdio>
#include<math.h>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<set>
#include<queue>
#include<map>
#define INF 999999
#define EPS 1.0e-6

using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;


string s;

int main()
{

		cin >> s;

		int fl = s.length();
		int cl = 0;

		while (s != "mew") {
			int i = 0;
			string ns = "";

			while (i < fl) {
				if (i < fl - 2) {
					if (s[i] == 'm'&&s[i + 1] == 'e'&&s[i + 2] == 'w') {
						i += 3;
					}
					else {
						ns += s[i];
						i++;
					}
				}
				else {
					ns += s[i];
					i++;
				}
			}
			cl = ns.length();
			if (fl == cl) {
				break;
			}
			fl = ns.length();
			s = ns;
			//cout << s << endl;

		}
		if (s == "mew") {
			cout << "Cat" << endl;
		}
		else {
			cout << "Rabbit" << endl;
		}

	
	return 0;
}


### Prompt

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

Example

Input

mmemewwemeww


Output

Cat

### Response

```cpp
#include<iostream>
#include<cstdio>
#include<math.h>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<set>
#include<queue>
#include<map>
#define INF 999999
#define EPS 1.0e-6

using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;


string s;

int main()
{

		cin >> s;

		int fl = s.length();
		int cl = 0;

		while (s != "mew") {
			int i = 0;
			string ns = "";

			while (i < fl) {
				if (i < fl - 2) {
					if (s[i] == 'm'&&s[i + 1] == 'e'&&s[i + 2] == 'w') {
						i += 3;
					}
					else {
						ns += s[i];
						i++;
					}
				}
				else {
					ns += s[i];
					i++;
				}
			}
			cl = ns.length();
			if (fl == cl) {
				break;
			}
			fl = ns.length();
			s = ns;
			//cout << s << endl;

		}
		if (s == "mew") {
			cout << "Cat" << endl;
		}
		else {
			cout << "Rabbit" << endl;
		}

	
	return 0;
}


```