stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include "bits/stdc++.h"

using namespace std;

#define pb          push_back

#define mp          make_pair

#define ll          long long

#define pii         pair<int, int>

#define vi          vector<int>

#define vii         vector<pii>

#define mi          map<int, int>

#define mii         map<pii, int>

#define all(a)      (a).begin(),(a).end()

#define x           first

#define y           second

#define sz(x)       (int)x.size()

#define endl        '\n'

#define hell        1000000007

#define debug(x) cout << '>' << #x << ':' << x << endl;

#define rep(i,a,b)  for(int i=a;i<b;i++)

#define rev(i,a,b)  for(int i=a;i>=b;i--)

#define lb          lower_bound

#define ub          upper_bound



#define bg(i)       i.begin()

#define fset(it,s)   for(auto it = s.begin(); it != s.end(); it++)

 

#define track(x)                 cerr<<#x<<": "<<x<<endl

#define track2(x, y)             cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl

#define track3(x, y, z)          cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl

#define track4(a, b, c, d)       cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl

 

#define ed(i)       i.end()

#define mem(a)	    memset(a, 0, sizeof(a))



#define MOD         1000000007

int mult(int a,int b, int p=MOD){return ((a%p)*(b%p))%p;}

int add(int a, int b, int p=MOD){return (a + b + p)%p;}

int fpow(int n, int k, int p = MOD) {int r = 1; for (; k; k >>= 1LL) {if (k & 1LL) r = mult(r,n,p); n = mult(n,n,p);} return r;}

int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}

void self_max(int &a, int b) {a = max(a, b); }

void self_min(int &a, int b) {a = min(a, b); }

void self_add(int &a, int b, int p = MOD) { a += b; if(a >= p) a -= p;}

void self_sub(int &a, int b, int p = MOD) { a -= b; if(a < 0) a += p;}

/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

 

const int INF = 1e9 + 5;

#define N	    	400001



void solve(){

    string s;

    cin>>s;

    if(s == "ABC")

        cout<<"ARC"<<endl;

    else

        cout<<"ABC"<<endl;



}

int main() {

	ios::sync_with_stdio(false);

	cout<<fixed<<setprecision(20);

	cin.tie(0);

	cout.tie(0);

	int t = 1;

//	cin>>t;

	while(t--){

		solve();

	}

}


// Faster C++ solution for the same problem (measured speedup: 5.408888816192521x):
#include <stdio.h>



int main() {

	char a[4];

	

	scanf("%s", &a);

	

	if (a[1] == 'R') {

		a[1] = 'B';

		printf("%s\n", a);

		return 0;

	}

	if(a[1] == 'B') {

		a[1] = 'R';

		printf("%s\n", a);

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    string s;

    cin>>s;

    if(s=="ABC")cout<<"ARC"<<endl;

    else if(s=="ARC")cout<<"ABC"<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.334614687705438x):
#include<stdio.h>

int main(){

	char x[5];

	char result;

	scanf("%s", &x);

	result = x[1];

	switch(result){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

}

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main(){

     string a;cin>>a;

     if(a=="ABC") cout<<"ARC";

     else cout<<"ABC";

}

// Faster C++ solution for the same problem (measured speedup: 5.322267862464304x):
#include<stdio.h>

int main(){

	char x[5];

	char result;

	scanf("%s", &x);

	result = x[1];

	switch(result){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

}

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

	string s;

	cin>>s;

	if(s[1]=='B')cout<<"ARC";

	if(s[1]=='R')cout<<"ABC";

}

// Faster C++ solution for the same problem (measured speedup: 5.317270730162343x):
#include<stdio.h>

int main(){

	char x[5];

	char result;

	scanf("%s", &x);

	result = x[1];

	switch(result){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

}

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cmath>

#include<stack>

#include<vector>

#include<cstring>

#include<algorithm>

#include<set>

#include<queue>

#include <vector>

#include <list>

#include <map>

#include <set>

#include <deque>

#include <stack>

#include <bitset>

#include <algorithm>

#include <functional>

#include <numeric>

#include <utility>

#include <complex>

#include <sstream>

#include <iomanip>

#include <cstdio>

#include <cmath>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <cassert>

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

const int inf =0x3f3f3f3f;

#define scn(a) scanf("%d",&a)

#define scd(a) scanf("%lf",&a)

#define scl(a) scanf("%lld",&a)

#define ptf(a) printf("%d\n",a)

#define mes(a,b) memset(a,b,sizeof(a))

#define fon(s,n) for(int i=s;i<=n;i++)

#define range(i,a,b) for(int i=a;i<=b;++i)

#define rerange(i,a,b) for(int i=a;i>=b;--i)

#define maxn 1000010

const int S=20;

ll gcd(ll a,ll b) { return b>0 ? gcd(b,a%b):a;}

ll lcm(ll a,ll b){return a*b/gcd(a,b);}

ll q_pow(ll a,ll b,ll mod)

{

	ll ans=1,res=a;

	while(b){

		if(b&1) ans=ans*res%mod;

		res=res*res%mod;

		b>>=1;

	}

	return ans%mod;

}



int month[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};

int main()

{

    string a="ARC",b="ABC";

    string temp;

    cin>>temp;

    if(temp==a) cout<<b<<endl;

    else cout<<a<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.328979623620248x):
#include<stdio.h>

int main(){

	char x[5];

	char result;

	scanf("%s", &x);

	result = x[1];

	switch(result){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

}

	return 0;

}
// Slower C++ solution:
#include "bits/stdc++.h"

using namespace std;

#define pb          push_back

#define mp          make_pair

#define ll          long long

#define pii         pair<int, int>

#define vi          vector<int>

#define vii         vector<pii>

#define mi          map<int, int>

#define mii         map<pii, int>

#define all(a)      (a).begin(),(a).end()

#define x           first

#define y           second

#define sz(x)       (int)x.size()

#define endl        '\n'

#define hell        1000000007

#define debug(x) cout << '>' << #x << ':' << x << endl;

#define rep(i,a,b)  for(int i=a;i<b;i++)

#define rev(i,a,b)  for(int i=a;i>=b;i--)

#define lb          lower_bound

#define ub          upper_bound



#define bg(i)       i.begin()

#define fset(it,s)   for(auto it = s.begin(); it != s.end(); it++)

 

#define track(x)                 cerr<<#x<<": "<<x<<endl

#define track2(x, y)             cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl

#define track3(x, y, z)          cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl

#define track4(a, b, c, d)       cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl

 

#define ed(i)       i.end()

#define mem(a)	    memset(a, 0, sizeof(a))



#define MOD         1000000007

int mult(int a,int b, int p=MOD){return ((a%p)*(b%p))%p;}

int add(int a, int b, int p=MOD){return (a + b + p)%p;}

int fpow(int n, int k, int p = MOD) {int r = 1; for (; k; k >>= 1LL) {if (k & 1LL) r = mult(r,n,p); n = mult(n,n,p);} return r;}

int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}

void self_max(int &a, int b) {a = max(a, b); }

void self_min(int &a, int b) {a = min(a, b); }

void self_add(int &a, int b, int p = MOD) { a += b; if(a >= p) a -= p;}

void self_sub(int &a, int b, int p = MOD) { a -= b; if(a < 0) a += p;}

/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

 

const int INF = 1e9 + 5;

#define N	    	400001



void solve(){

    string s;

    cin>>s;

    if(s == "ABC")

        cout<<"ARC"<<endl;

    else

        cout<<"ABC"<<endl;



}

int main() {

	ios::sync_with_stdio(false);

	cout<<fixed<<setprecision(20);

	cin.tie(0);

	cout.tie(0);

	int t = 1;

//	cin>>t;

	while(t--){

		solve();

	}

}


// Faster C++ solution for the same problem (measured speedup: 5.447160230194539x):
#include<stdio.h>

int main(){

	char x[5];

	char result;

	scanf("%s", &x);

	result = x[1];

	switch(result){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    string s;

    cin>>s;

    if(s=="ABC")cout<<"ARC"<<endl;

    else if(s=="ARC")cout<<"ABC"<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.34734678989422x):
#include <stdio.h>



int main(){

	char a[5];

	scanf ("%s", a);

	

	for (int i = 0; i != '/0'; i++){

		if (a[i] == 'B'){

			puts ("ARC");

			break;

		}

		else if (a[i] == 'R'){

			puts ("ABC");

			break;

		}

	}

 	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main(){

     string a;cin>>a;

     if(a=="ABC") cout<<"ARC";

     else cout<<"ABC";

}

// Faster C++ solution for the same problem (measured speedup: 5.33497049653779x):
#include <stdio.h>



int main(){

	char a[5];

	scanf ("%s", a);

	

	for (int i = 0; i != '/0'; i++){

		if (a[i] == 'B'){

			puts ("ARC");

			break;

		}

		else if (a[i] == 'R'){

			puts ("ABC");

			break;

		}

	}

 	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

	string s;

	cin>>s;

	if(s[1]=='B')cout<<"ARC";

	if(s[1]=='R')cout<<"ABC";

}

// Faster C++ solution for the same problem (measured speedup: 5.3299614376014155x):
#include <stdio.h>



int main(){

	char a[5];

	scanf ("%s", a);

	

	for (int i = 0; i != '/0'; i++){

		if (a[i] == 'B'){

			puts ("ARC");

			break;

		}

		else if (a[i] == 'R'){

			puts ("ABC");

			break;

		}

	}

 	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cmath>

#include<stack>

#include<vector>

#include<cstring>

#include<algorithm>

#include<set>

#include<queue>

#include <vector>

#include <list>

#include <map>

#include <set>

#include <deque>

#include <stack>

#include <bitset>

#include <algorithm>

#include <functional>

#include <numeric>

#include <utility>

#include <complex>

#include <sstream>

#include <iomanip>

#include <cstdio>

#include <cmath>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <cassert>

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

const int inf =0x3f3f3f3f;

#define scn(a) scanf("%d",&a)

#define scd(a) scanf("%lf",&a)

#define scl(a) scanf("%lld",&a)

#define ptf(a) printf("%d\n",a)

#define mes(a,b) memset(a,b,sizeof(a))

#define fon(s,n) for(int i=s;i<=n;i++)

#define range(i,a,b) for(int i=a;i<=b;++i)

#define rerange(i,a,b) for(int i=a;i>=b;--i)

#define maxn 1000010

const int S=20;

ll gcd(ll a,ll b) { return b>0 ? gcd(b,a%b):a;}

ll lcm(ll a,ll b){return a*b/gcd(a,b);}

ll q_pow(ll a,ll b,ll mod)

{

	ll ans=1,res=a;

	while(b){

		if(b&1) ans=ans*res%mod;

		res=res*res%mod;

		b>>=1;

	}

	return ans%mod;

}



int month[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};

int main()

{

    string a="ARC",b="ABC";

    string temp;

    cin>>temp;

    if(temp==a) cout<<b<<endl;

    else cout<<a<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.341698276625542x):
#include <stdio.h>



int main(){

	char a[5];

	scanf ("%s", a);

	

	for (int i = 0; i != '/0'; i++){

		if (a[i] == 'B'){

			puts ("ARC");

			break;

		}

		else if (a[i] == 'R'){

			puts ("ABC");

			break;

		}

	}

 	return 0;

}
// Slower C++ solution:
#include "bits/stdc++.h"

using namespace std;

#define pb          push_back

#define mp          make_pair

#define ll          long long

#define pii         pair<int, int>

#define vi          vector<int>

#define vii         vector<pii>

#define mi          map<int, int>

#define mii         map<pii, int>

#define all(a)      (a).begin(),(a).end()

#define x           first

#define y           second

#define sz(x)       (int)x.size()

#define endl        '\n'

#define hell        1000000007

#define debug(x) cout << '>' << #x << ':' << x << endl;

#define rep(i,a,b)  for(int i=a;i<b;i++)

#define rev(i,a,b)  for(int i=a;i>=b;i--)

#define lb          lower_bound

#define ub          upper_bound



#define bg(i)       i.begin()

#define fset(it,s)   for(auto it = s.begin(); it != s.end(); it++)

 

#define track(x)                 cerr<<#x<<": "<<x<<endl

#define track2(x, y)             cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl

#define track3(x, y, z)          cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl

#define track4(a, b, c, d)       cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl

 

#define ed(i)       i.end()

#define mem(a)	    memset(a, 0, sizeof(a))



#define MOD         1000000007

int mult(int a,int b, int p=MOD){return ((a%p)*(b%p))%p;}

int add(int a, int b, int p=MOD){return (a + b + p)%p;}

int fpow(int n, int k, int p = MOD) {int r = 1; for (; k; k >>= 1LL) {if (k & 1LL) r = mult(r,n,p); n = mult(n,n,p);} return r;}

int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}

void self_max(int &a, int b) {a = max(a, b); }

void self_min(int &a, int b) {a = min(a, b); }

void self_add(int &a, int b, int p = MOD) { a += b; if(a >= p) a -= p;}

void self_sub(int &a, int b, int p = MOD) { a -= b; if(a < 0) a += p;}

/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

 

const int INF = 1e9 + 5;

#define N	    	400001



void solve(){

    string s;

    cin>>s;

    if(s == "ABC")

        cout<<"ARC"<<endl;

    else

        cout<<"ABC"<<endl;



}

int main() {

	ios::sync_with_stdio(false);

	cout<<fixed<<setprecision(20);

	cin.tie(0);

	cout.tie(0);

	int t = 1;

//	cin>>t;

	while(t--){

		solve();

	}

}


// Faster C++ solution for the same problem (measured speedup: 5.460160944350961x):
#include <stdio.h>



int main(){

	char a[5];

	scanf ("%s", a);

	

	for (int i = 0; i != '/0'; i++){

		if (a[i] == 'B'){

			puts ("ARC");

			break;

		}

		else if (a[i] == 'R'){

			puts ("ABC");

			break;

		}

	}

 	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    string s;

    cin>>s;

    if(s=="ABC")cout<<"ARC"<<endl;

    else if(s=="ARC")cout<<"ABC"<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.332562421411891x):
#include <stdio.h>





int main(){

char input [6];

scanf("%s",input);

if (input[1] == 'B'){

	printf("ARC\n");

}

else if (input[1]=='R'){

	printf("ABC\n");

}

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main(){

     string a;cin>>a;

     if(a=="ABC") cout<<"ARC";

     else cout<<"ABC";

}

// Faster C++ solution for the same problem (measured speedup: 5.32022034608706x):
#include <stdio.h>





int main(){

char input [6];

scanf("%s",input);

if (input[1] == 'B'){

	printf("ARC\n");

}

else if (input[1]=='R'){

	printf("ABC\n");

}

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

	string s;

	cin>>s;

	if(s[1]=='B')cout<<"ARC";

	if(s[1]=='R')cout<<"ABC";

}

// Faster C++ solution for the same problem (measured speedup: 5.315225136219388x):
#include <stdio.h>





int main(){

char input [6];

scanf("%s",input);

if (input[1] == 'B'){

	printf("ARC\n");

}

else if (input[1]=='R'){

	printf("ABC\n");

}

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cmath>

#include<stack>

#include<vector>

#include<cstring>

#include<algorithm>

#include<set>

#include<queue>

#include <vector>

#include <list>

#include <map>

#include <set>

#include <deque>

#include <stack>

#include <bitset>

#include <algorithm>

#include <functional>

#include <numeric>

#include <utility>

#include <complex>

#include <sstream>

#include <iomanip>

#include <cstdio>

#include <cmath>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <cassert>

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

const int inf =0x3f3f3f3f;

#define scn(a) scanf("%d",&a)

#define scd(a) scanf("%lf",&a)

#define scl(a) scanf("%lld",&a)

#define ptf(a) printf("%d\n",a)

#define mes(a,b) memset(a,b,sizeof(a))

#define fon(s,n) for(int i=s;i<=n;i++)

#define range(i,a,b) for(int i=a;i<=b;++i)

#define rerange(i,a,b) for(int i=a;i>=b;--i)

#define maxn 1000010

const int S=20;

ll gcd(ll a,ll b) { return b>0 ? gcd(b,a%b):a;}

ll lcm(ll a,ll b){return a*b/gcd(a,b);}

ll q_pow(ll a,ll b,ll mod)

{

	ll ans=1,res=a;

	while(b){

		if(b&1) ans=ans*res%mod;

		res=res*res%mod;

		b>>=1;

	}

	return ans%mod;

}



int month[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};

int main()

{

    string a="ARC",b="ABC";

    string temp;

    cin>>temp;

    if(temp==a) cout<<b<<endl;

    else cout<<a<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.326929525178133x):
#include <stdio.h>





int main(){

char input [6];

scanf("%s",input);

if (input[1] == 'B'){

	printf("ARC\n");

}

else if (input[1]=='R'){

	printf("ABC\n");

}

	

	return 0;

}
// Slower C++ solution:
#include "bits/stdc++.h"

using namespace std;

#define pb          push_back

#define mp          make_pair

#define ll          long long

#define pii         pair<int, int>

#define vi          vector<int>

#define vii         vector<pii>

#define mi          map<int, int>

#define mii         map<pii, int>

#define all(a)      (a).begin(),(a).end()

#define x           first

#define y           second

#define sz(x)       (int)x.size()

#define endl        '\n'

#define hell        1000000007

#define debug(x) cout << '>' << #x << ':' << x << endl;

#define rep(i,a,b)  for(int i=a;i<b;i++)

#define rev(i,a,b)  for(int i=a;i>=b;i--)

#define lb          lower_bound

#define ub          upper_bound



#define bg(i)       i.begin()

#define fset(it,s)   for(auto it = s.begin(); it != s.end(); it++)

 

#define track(x)                 cerr<<#x<<": "<<x<<endl

#define track2(x, y)             cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl

#define track3(x, y, z)          cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl

#define track4(a, b, c, d)       cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl

 

#define ed(i)       i.end()

#define mem(a)	    memset(a, 0, sizeof(a))



#define MOD         1000000007

int mult(int a,int b, int p=MOD){return ((a%p)*(b%p))%p;}

int add(int a, int b, int p=MOD){return (a + b + p)%p;}

int fpow(int n, int k, int p = MOD) {int r = 1; for (; k; k >>= 1LL) {if (k & 1LL) r = mult(r,n,p); n = mult(n,n,p);} return r;}

int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}

void self_max(int &a, int b) {a = max(a, b); }

void self_min(int &a, int b) {a = min(a, b); }

void self_add(int &a, int b, int p = MOD) { a += b; if(a >= p) a -= p;}

void self_sub(int &a, int b, int p = MOD) { a -= b; if(a < 0) a += p;}

/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

 

const int INF = 1e9 + 5;

#define N	    	400001



void solve(){

    string s;

    cin>>s;

    if(s == "ABC")

        cout<<"ARC"<<endl;

    else

        cout<<"ABC"<<endl;



}

int main() {

	ios::sync_with_stdio(false);

	cout<<fixed<<setprecision(20);

	cin.tie(0);

	cout.tie(0);

	int t = 1;

//	cin>>t;

	while(t--){

		solve();

	}

}


// Faster C++ solution for the same problem (measured speedup: 5.44506466678642x):
#include <stdio.h>





int main(){

char input [6];

scanf("%s",input);

if (input[1] == 'B'){

	printf("ARC\n");

}

else if (input[1]=='R'){

	printf("ABC\n");

}

	

	return 0;

}
// Slower C++ solution:
#pragma region 

#include<iostream>

#include<algorithm>

#include<vector>

#include<stack>

#include<queue>

#include<map>

#include<cstring>

#include<string>

typedef long long ll;

template <typename T>void read(T &x){x=0;char ch=getchar();ll f=1;while(!isdigit(ch)){if(ch=='-')f*=-1;ch=getchar();}while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}x*=f;}

#define IO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)

using namespace std;

#pragma endregion

const int maxn = 1e5 + 5;

int a[maxn][3];



int main() {

    IO;

    string s;

    cin >> s;

    cout << (s == "ABC" ? "ARC\n" : "ABC\n");

}

// Faster C++ solution for the same problem (measured speedup: 5.413376305805778x):
#include <stdio.h>

#include <string.h>



int main(){

	

	char contest[5];

	scanf("%s", &contest);

	

	if(strcmp(contest, "ABC") == 0){

		printf("ARC");

	}else if(strcmp(contest,"ARC") == 0){

		printf("ABC");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define ll long long

#define ull unsigned long long

#define IO ios::sync_with_stdio(false), cin.tie(0)

#define endl '\n'

#define pi acos(-1.0)

#define ms(a, x) memset(a, x, sizeof(a))

#define lowbit(x) ((x)&(-(x)))

#define pb push_back

#define binarycount __builtin_popcount(x)

#define tr t[root]

#define lson t[root << 1]

#define rson t[root << 1 | 1]

#define debug(x) cout<<x<<'\n'

#define pii pair<ll,pair<ll,ll> >

using namespace std;

const int inf = 0x3f3f3f3f;

const ll INF=0x3f3f3f3f3f3f3f3f;

const ll mod = 1e9+7;

const double eps = 1e-8;

ll gcd(ll a, ll b) {return b==0?a:gcd(b, a%b);}

ll lcm(ll a, ll b) {return a/gcd(a, b)*b;}

ll powmod(ll a,ll b){

    ll ans = 1, pow = a;

    while(b) { if(b&1) ans = (ans*pow)%mod; pow = (pow*pow)%mod; b >>= 1; }

    return ans;

}

ll mul(ll a,ll b){//大数取模乘法防止溢出

    ll ans=0;

    a%=mod,b%=mod;

    while(b) { if(b&1) ans = (ans+a)%mod; a = (a*2)%mod; b >>= 1; }

    return ans;

}

//(b/a)%p=b*a^(p-2)%p

int pr(ll num){//判断素数

     if(num == 1) return 0;

     if(num ==2|| num==3 ) return 1 ;

     if(num %6!= 1&&num %6!= 5) return 0 ;

     int tmp =sqrt( num);

     for(int i= 5;i <=tmp; i+=6 )

          if(num %i== 0||num %(i+ 2)==0 )return 0 ;

     return 1 ;

}

int Day(int y,int m, int d){

    if(m==1||m==2) { m+=12; y--; }

    int w=(d+2*m+3*(m+1)/5+y+y/4-y/100+y/400)%7;

    return w+1;

}

inline int read() {

    int c = 0, f = 1;

    char ch = getchar();

    while (ch < '0' || ch > '9') {

        if (ch == '-') f = -1;

        ch = getchar();

    }

    while (ch >= '0' && ch <= '9') {

        c = c * 10 + ch - '0';

        ch = getchar();

    }

    return c * f;

}



//#pragma comment(linker, "/STACK:1024000000,1024000000")//外挂开栈

//stable_sort 排序不处理相同元素

//map<int,int>::reverse_iterator rit;

//for(rit=mp.rbegin();rit!=mp.rend();rit++)

//vec动态二维数组

//vector<vector<int>> g(26,vector<int>(100005));

//初始化vec里面套了n个vec



//lower_bound(begin,end,num) 有序数列中返回第一个>=num的数字的地址

//upper_bound( begin,end,num) 返回第一个>num的数字的地址



const int maxn=1e5+5;

int main(){

    string s;

    cin>>s;

    if(s=="ABC") cout<<"ARC"<<endl;

    else cout<<"ABC"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.364647200196583x):
#include <stdio.h>

#include <string.h>



int main(){

	

	char contest[5];

	scanf("%s", &contest);

	

	if(strcmp(contest, "ABC") == 0){

		printf("ARC");

	}else if(strcmp(contest,"ARC") == 0){

		printf("ABC");

	}

	return 0;

}