stablegradients/pie-gem5-pairs huggingface dataset:
// 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.400631409954572x):
#include <string.h>

#include <stdio.h>



int main() {

	char s[10];

	scanf("%s", &s);

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

		printf("ARC\n");

	}

	else {

		printf("ABC\n");

	}

	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.352017028935139x):
#include <string.h>

#include <stdio.h>



int main() {

	char s[10];

	scanf("%s", &s);

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

		printf("ARC\n");

	}

	else {

		printf("ABC\n");

	}

	return 0;

}
// Slower C++ solution:
#pragma GCC optimize("O3")

#pragma G++ optimize("O3")

#include <bits/stdc++.h>

using namespace std;

#define ll long long

#define ull unsigned long long

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

#define mp(a, b) make_pair(a, b)

#define pi acos(-1)

#define pii pair<int, int>

#define pll pair<ll, ll>

#define pdd pair<double, double>

#define vi vector<int>

#define vl vector<ll>

#define pb push_back

#define lson l, mid, rt << 1

#define rson mid + 1, r, rt << 1 | 1

const ll INF = 0x3f3f3f3f3f3f3f;

const double eps = 1e-8;

const int maxn = 4e3 + 7;

const int maxm = 1e5 + 7;

const int mod = 192600817;

#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

int main()

{

    IO;

    string s;

    cin>>s;

    if (s[1]=='B')

    cout<<"ARC"<<endl;

    else

    cout<<"ABC"<<endl;

    return 0;

}

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

#include <stdio.h>



int main() {

	char s[10];

	scanf("%s", &s);

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

		printf("ARC\n");

	}

	else {

		printf("ABC\n");

	}

	return 0;

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

#include <stdio.h>

#include <cstring>

#include <string>

#include <vector>

#include <set>

#include <map>

#include <algorithm>

#include <cmath>

#include <queue>

#include <stack>

using namespace std;

typedef long long ll;

const int maxn=1e5+111;

int main(){

    char s[10];

    scanf("%s",s);

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

        puts("ARC");

    }

    else{

        puts("ABC");

    }

    return 0;

}

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

#include <stdio.h>



int main() {

	char s[10];

	scanf("%s", &s);

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

		printf("ARC\n");

	}

	else {

		printf("ABC\n");

	}

	return 0;

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

 #include<algorithm>

 #include<cmath>

 #include<iomanip>

 #include<string.h>

 #include<cmath>

 #include<map>

 #include<vector>

using namespace std;

typedef long long ll;

char s[4005];

int main()

{



char a,b,c;

cin>>a>>b>>c;

if(b=='B')

cout<<"ARC";

else

cout<<"ABC";

}


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

#include <stdio.h>



int main() {

	char s[10];

	scanf("%s", &s);

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

		printf("ARC\n");

	}

	else {

		printf("ABC\n");

	}

	return 0;

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



using namespace std;



int main() {

    string z;

    cin>>z;

    if(z=="ABC"){

        cout<<"ARC"<<"\n";

    }

    else if(z=="ARC"){

        cout<<"ABC"<<"\n";

    }

    return 0;

}

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

#include <stdio.h>



int main() {

	char s[10];

	scanf("%s", &s);

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

		printf("ARC\n");

	}

	else {

		printf("ABC\n");

	}

	return 0;

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

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

const int N = 3030;

int main()

{

	string s;

	cin>>s;

	if(s=="ABC")

		cout<<"ARC"<<endl;

	else

		cout<<"ABC"<<endl;

}


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

#include <stdio.h>



int main() {

	char s[10];

	scanf("%s", &s);

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

		printf("ARC\n");

	}

	else {

		printf("ABC\n");

	}

	return 0;

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

using namespace std;

int main()

{

	string a;

	cin>>a;

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

	 cout<<"ARC"<<endl;

	else

	 cout<<"ABC"<<endl;

	return 0;

}

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

#include <stdio.h>



int main() {

	char s[10];

	scanf("%s", &s);

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

		printf("ARC\n");

	}

	else {

		printf("ABC\n");

	}

	return 0;

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

#include<algorithm>

#include<cstring>

#include<cmath>

#include<stdio.h>

#include<queue>

#include<iomanip>

#define pi 3.1415927

using namespace std;

typedef long long  ll;

const long long maxt=1e18;

int main()

{

	char a[10];

	cin>>a;

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

	cout<<"ARC";

	else

	cout<<"ABC";

}

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

#include <stdio.h>



int main() {

	char s[10];

	scanf("%s", &s);

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

		printf("ARC\n");

	}

	else {

		printf("ABC\n");

	}

	return 0;

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

using namespace std;



string s;



signed main()

{

	while(cin>>s){

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

		else cout<<"ABC"<<endl;

	}

	return 0;

}

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

#include <stdio.h>



int main() {

	char s[10];

	scanf("%s", &s);

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

		printf("ARC\n");

	}

	else {

		printf("ABC\n");

	}

	return 0;

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

using namespace std;



string s;



int main()

{

	while(cin>>s){

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

		else cout<<"ABC"<<endl;

	}

	return 0;

}

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

#include <stdio.h>



int main() {

	char s[10];

	scanf("%s", &s);

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

		printf("ARC\n");

	}

	else {

		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.410303946042352x):
#include <stdio.h>

int main(){

	char input[5];

	scanf("%s", &input);

	switch(input[1]){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

	}



	

	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.361602496619411x):
#include <stdio.h>

int main(){

	char input[5];

	scanf("%s", &input);

	switch(input[1]){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

	}



	

	return 0;

}
// Slower C++ solution:
#pragma GCC optimize("O3")

#pragma G++ optimize("O3")

#include <bits/stdc++.h>

using namespace std;

#define ll long long

#define ull unsigned long long

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

#define mp(a, b) make_pair(a, b)

#define pi acos(-1)

#define pii pair<int, int>

#define pll pair<ll, ll>

#define pdd pair<double, double>

#define vi vector<int>

#define vl vector<ll>

#define pb push_back

#define lson l, mid, rt << 1

#define rson mid + 1, r, rt << 1 | 1

const ll INF = 0x3f3f3f3f3f3f3f;

const double eps = 1e-8;

const int maxn = 4e3 + 7;

const int maxm = 1e5 + 7;

const int mod = 192600817;

#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

int main()

{

    IO;

    string s;

    cin>>s;

    if (s[1]=='B')

    cout<<"ARC"<<endl;

    else

    cout<<"ABC"<<endl;

    return 0;

}

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

int main(){

	char input[5];

	scanf("%s", &input);

	switch(input[1]){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

	}



	

	return 0;

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

#include <stdio.h>

#include <cstring>

#include <string>

#include <vector>

#include <set>

#include <map>

#include <algorithm>

#include <cmath>

#include <queue>

#include <stack>

using namespace std;

typedef long long ll;

const int maxn=1e5+111;

int main(){

    char s[10];

    scanf("%s",s);

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

        puts("ARC");

    }

    else{

        puts("ABC");

    }

    return 0;

}

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

int main(){

	char input[5];

	scanf("%s", &input);

	switch(input[1]){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

	}



	

	return 0;

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

 #include<algorithm>

 #include<cmath>

 #include<iomanip>

 #include<string.h>

 #include<cmath>

 #include<map>

 #include<vector>

using namespace std;

typedef long long ll;

char s[4005];

int main()

{



char a,b,c;

cin>>a>>b>>c;

if(b=='B')

cout<<"ARC";

else

cout<<"ABC";

}


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

int main(){

	char input[5];

	scanf("%s", &input);

	switch(input[1]){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

	}



	

	return 0;

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



using namespace std;



int main() {

    string z;

    cin>>z;

    if(z=="ABC"){

        cout<<"ARC"<<"\n";

    }

    else if(z=="ARC"){

        cout<<"ABC"<<"\n";

    }

    return 0;

}

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

int main(){

	char input[5];

	scanf("%s", &input);

	switch(input[1]){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

	}



	

	return 0;

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

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

const int N = 3030;

int main()

{

	string s;

	cin>>s;

	if(s=="ABC")

		cout<<"ARC"<<endl;

	else

		cout<<"ABC"<<endl;

}


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

int main(){

	char input[5];

	scanf("%s", &input);

	switch(input[1]){

		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[1]=='B')

	 cout<<"ARC"<<endl;

	else

	 cout<<"ABC"<<endl;

	return 0;

}

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

int main(){

	char input[5];

	scanf("%s", &input);

	switch(input[1]){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

	}



	

	return 0;

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

#include<algorithm>

#include<cstring>

#include<cmath>

#include<stdio.h>

#include<queue>

#include<iomanip>

#define pi 3.1415927

using namespace std;

typedef long long  ll;

const long long maxt=1e18;

int main()

{

	char a[10];

	cin>>a;

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

	cout<<"ARC";

	else

	cout<<"ABC";

}

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

int main(){

	char input[5];

	scanf("%s", &input);

	switch(input[1]){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

	}



	

	return 0;

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

using namespace std;



string s;



signed main()

{

	while(cin>>s){

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

		else cout<<"ABC"<<endl;

	}

	return 0;

}

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

int main(){

	char input[5];

	scanf("%s", &input);

	switch(input[1]){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

	}



	

	return 0;

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

using namespace std;



string s;



int main()

{

	while(cin>>s){

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

		else cout<<"ABC"<<endl;

	}

	return 0;

}

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

int main(){

	char input[5];

	scanf("%s", &input);

	switch(input[1]){

		case 'B':

			printf("ARC");

			break;

		case 'R':

			printf("ABC");

			break;

	}



	

	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>

int main(){

	 char a[10]="ABC";

	 

     scanf("%s",a);

     

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

        	

	 	printf("ARC");

	 }	else{

	 	a[1]=='R';

	 	printf("ABC",a);

	 }

	

	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>

int main(){

	 char a[10]="ABC";

	 

     scanf("%s",a);

     

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

        	

	 	printf("ARC");

	 }	else{

	 	a[1]=='R';

	 	printf("ABC",a);

	 }

	

	return 0;

}
// Slower C++ solution:
#pragma GCC optimize("O3")

#pragma G++ optimize("O3")

#include <bits/stdc++.h>

using namespace std;

#define ll long long

#define ull unsigned long long

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

#define mp(a, b) make_pair(a, b)

#define pi acos(-1)

#define pii pair<int, int>

#define pll pair<ll, ll>

#define pdd pair<double, double>

#define vi vector<int>

#define vl vector<ll>

#define pb push_back

#define lson l, mid, rt << 1

#define rson mid + 1, r, rt << 1 | 1

const ll INF = 0x3f3f3f3f3f3f3f;

const double eps = 1e-8;

const int maxn = 4e3 + 7;

const int maxm = 1e5 + 7;

const int mod = 192600817;

#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

int main()

{

    IO;

    string s;

    cin>>s;

    if (s[1]=='B')

    cout<<"ARC"<<endl;

    else

    cout<<"ABC"<<endl;

    return 0;

}

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

int main(){

	 char a[10]="ABC";

	 

     scanf("%s",a);

     

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

        	

	 	printf("ARC");

	 }	else{

	 	a[1]=='R';

	 	printf("ABC",a);

	 }

	

	return 0;

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

#include <stdio.h>

#include <cstring>

#include <string>

#include <vector>

#include <set>

#include <map>

#include <algorithm>

#include <cmath>

#include <queue>

#include <stack>

using namespace std;

typedef long long ll;

const int maxn=1e5+111;

int main(){

    char s[10];

    scanf("%s",s);

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

        puts("ARC");

    }

    else{

        puts("ABC");

    }

    return 0;

}

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

int main(){

	 char a[10]="ABC";

	 

     scanf("%s",a);

     

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

        	

	 	printf("ARC");

	 }	else{

	 	a[1]=='R';

	 	printf("ABC",a);

	 }

	

	return 0;

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

 #include<algorithm>

 #include<cmath>

 #include<iomanip>

 #include<string.h>

 #include<cmath>

 #include<map>

 #include<vector>

using namespace std;

typedef long long ll;

char s[4005];

int main()

{



char a,b,c;

cin>>a>>b>>c;

if(b=='B')

cout<<"ARC";

else

cout<<"ABC";

}


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

int main(){

	 char a[10]="ABC";

	 

     scanf("%s",a);

     

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

        	

	 	printf("ARC");

	 }	else{

	 	a[1]=='R';

	 	printf("ABC",a);

	 }

	

	return 0;

}