stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <cstdio>

#include <algorithm>

#include <vector>

#include <set>

#include <queue>

#include <algorithm>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <iostream>

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

 

#define pb push_back

#define mk make_pair

#define f0(i,b) for(int i=0;i<(b);i++)

#define f1(i,b) for(int i=1;i<=(b);i++)

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

#define sf(a) scanf("%d",&a);

#define sfl(a) scanf("%lld",&a);

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

#define pfl(a) printf("%lld\n",a);

#define TEST int test; cin >> test;while(test--)

#define ii pair<int,int>

#define iil pair<ll,ll>

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

#define INF 2147483647

 

 

int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};

int dy8[] = {1,-1, 1, -1, 0, 0, -1, 1};

int dx4[] = {0, 0, 1, -1};

int dy4[] = {1, -1, 0, 0};

const double pi = acos(-1.0);

 

 

void solve()

{

   string s;

   cin >> s;

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

   else cout <<"ABC" <<endl;

}

 

int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(NULL);

    cout.tie(NULL);

    //freopen("input.txt", "r", stdin);

    //freopen("output.txt", "w", stdout);

    //TEST

    solve();

    return 0;

}

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

#include <string.h>



int main() {

    char S[3];

    scanf("%s", &S);

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

        printf("ARC");

    } else {

        printf("ABC");

    }

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

using namespace std;

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

#include <string.h>



int main() {

    char S[3];

    scanf("%s", &S);

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

        printf("ARC");

    } else {

        printf("ABC");

    }

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

#define pb push_back

#define ff first;

#define ss second;

#define ii pair<int,int>

#define vi vector<int>

#define vii vector<ii>

#define lli long long int

#define INF 1000000000

#define endl '\n'

const double pi = 3.141592653589793238460;

typedef std::complex<double> Complex;

typedef std::valarray<Complex> CArray;

using namespace std;

	

int main(){

	ios::sync_with_stdio(0);

	cin.tie(0);

	string n;

	cin >> n;

	if(n=="ABC"){

		cout << "ARC" << endl;

	}

	else{

		cout << "ABC" << endl;

	}

	

	

	return 0;

}




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

#include <string.h>



int main() {

    char S[3];

    scanf("%s", &S);

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

        printf("ARC");

    } else {

        printf("ABC");

    }

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

using namespace std;

int main()

{

    string str;

    while(cin>>str)

    {

        if(str=="ABC")

        {

            cout<<"ARC"<<endl;

        }

        else if(str=="ARC")

        {

            cout<<"ABC"<<endl;

        }

    }

}


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

#include <string.h>



int main() {

    char S[3];

    scanf("%s", &S);

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

        printf("ARC");

    } else {

        printf("ABC");

    }

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

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

using namespace std;

typedef long long ll;

const int maxn = 1e5 + 5;

const int inf = ~0u >> 1;

int main() {

    IO;

    string s;

    cin >> s;

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

    return 0;

}

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

 

int main() {

	char n[4];

	scanf("%s", n);

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

		puts("ARC");		

	}else if(n[1] == 'R'){

		puts("ABC");

	}

	

	

	return 0;

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

#define eps 1e-3

#define pi acos(-1.0)

#define inf 0x3f

#define INF 0x3f3f3f3f

#define pb push_back

#define debug1 cout<<"&&";

#define debug2 cout<<"**";

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

#define for0(i, n) for(int i = 0; i < n; ++i)

#define for1(i, n) for(int i = 1; i <= n; ++i)

using namespace std;

typedef double db;

typedef long long ll;

typedef unsigned long long ull;

typedef pair<int, int> pii;

typedef pair<long long, int> pli;

typedef pair<long long, long long> pll;

const int mod = 1e9 + 7;

const int N = 1e5+10;

const int M = 1e6+10;

/*=================================================================================*/



string s;

int main() {

   cin>>s;

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

   else puts("ABC");

}

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

 

int main() {

	char n[4];

	scanf("%s", n);

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

		puts("ARC");		

	}else if(n[1] == 'R'){

		puts("ABC");

	}

	

	

	return 0;

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

using namespace std;



int main() {



    string A,B,X;



    A="ABC";

    B="ARC";



    cin>>X;



    if( X == A ){



        cout << B << endl;



    }else{

        cout << A << endl;

    }

}


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

 

int main() {

	char n[4];

	scanf("%s", n);

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

		puts("ARC");		

	}else if(n[1] == 'R'){

		puts("ABC");

	}

	

	

	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 cout << "ABC" << endl;

}

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

 

int main() {

	char n[4];

	scanf("%s", n);

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

		puts("ARC");		

	}else if(n[1] == 'R'){

		puts("ABC");

	}

	

	

	return 0;

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

using namespace std;



main()

{

    string s;



    cin >> s;



    if(s == "ABC")

         cout <<"ARC";

    else

        cout <<"ABC";

}


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

 

int main() {

	char n[4];

	scanf("%s", n);

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

		puts("ARC");		

	}else if(n[1] == 'R'){

		puts("ABC");

	}

	

	

	return 0;

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

#include <algorithm>

#include <vector>

#include <set>

#include <queue>

#include <algorithm>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <iostream>

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

 

#define pb push_back

#define mk make_pair

#define f0(i,b) for(int i=0;i<(b);i++)

#define f1(i,b) for(int i=1;i<=(b);i++)

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

#define sf(a) scanf("%d",&a);

#define sfl(a) scanf("%lld",&a);

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

#define pfl(a) printf("%lld\n",a);

#define TEST int test; cin >> test;while(test--)

#define ii pair<int,int>

#define iil pair<ll,ll>

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

#define INF 2147483647

 

 

int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};

int dy8[] = {1,-1, 1, -1, 0, 0, -1, 1};

int dx4[] = {0, 0, 1, -1};

int dy4[] = {1, -1, 0, 0};

const double pi = acos(-1.0);

 

 

void solve()

{

   string s;

   cin >> s;

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

   else cout <<"ABC" <<endl;

}

 

int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(NULL);

    cout.tie(NULL);

    //freopen("input.txt", "r", stdin);

    //freopen("output.txt", "w", stdout);

    //TEST

    solve();

    return 0;

}

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

 

int main() {

	char n[4];

	scanf("%s", n);

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

		puts("ARC");		

	}else if(n[1] == 'R'){

		puts("ABC");

	}

	

	

	return 0;

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

using namespace std;

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

 

int main() {

	char n[4];

	scanf("%s", n);

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

		puts("ARC");		

	}else if(n[1] == 'R'){

		puts("ABC");

	}

	

	

	return 0;

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

#define pb push_back

#define ff first;

#define ss second;

#define ii pair<int,int>

#define vi vector<int>

#define vii vector<ii>

#define lli long long int

#define INF 1000000000

#define endl '\n'

const double pi = 3.141592653589793238460;

typedef std::complex<double> Complex;

typedef std::valarray<Complex> CArray;

using namespace std;

	

int main(){

	ios::sync_with_stdio(0);

	cin.tie(0);

	string n;

	cin >> n;

	if(n=="ABC"){

		cout << "ARC" << endl;

	}

	else{

		cout << "ABC" << endl;

	}

	

	

	return 0;

}




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

 

int main() {

	char n[4];

	scanf("%s", n);

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

		puts("ARC");		

	}else if(n[1] == 'R'){

		puts("ABC");

	}

	

	

	return 0;

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

using namespace std;

int main()

{

    string str;

    while(cin>>str)

    {

        if(str=="ABC")

        {

            cout<<"ARC"<<endl;

        }

        else if(str=="ARC")

        {

            cout<<"ABC"<<endl;

        }

    }

}


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

 

int main() {

	char n[4];

	scanf("%s", n);

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

		puts("ARC");		

	}else if(n[1] == 'R'){

		puts("ABC");

	}

	

	

	return 0;

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

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

using namespace std;

typedef long long ll;

const int maxn = 1e5 + 5;

const int inf = ~0u >> 1;

int main() {

    IO;

    string s;

    cin >> s;

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

    return 0;

}

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



int main(){

	char a[3];

	scanf("%s",a);

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

		a[1]='R';

	}

	else{

		a[1]='B';

	}

	printf("%s",a);

	return 0;

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

#define eps 1e-3

#define pi acos(-1.0)

#define inf 0x3f

#define INF 0x3f3f3f3f

#define pb push_back

#define debug1 cout<<"&&";

#define debug2 cout<<"**";

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

#define for0(i, n) for(int i = 0; i < n; ++i)

#define for1(i, n) for(int i = 1; i <= n; ++i)

using namespace std;

typedef double db;

typedef long long ll;

typedef unsigned long long ull;

typedef pair<int, int> pii;

typedef pair<long long, int> pli;

typedef pair<long long, long long> pll;

const int mod = 1e9 + 7;

const int N = 1e5+10;

const int M = 1e6+10;

/*=================================================================================*/



string s;

int main() {

   cin>>s;

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

   else puts("ABC");

}

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



int main(){

	char a[3];

	scanf("%s",a);

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

		a[1]='R';

	}

	else{

		a[1]='B';

	}

	printf("%s",a);

	return 0;

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

using namespace std;



int main() {



    string A,B,X;



    A="ABC";

    B="ARC";



    cin>>X;



    if( X == A ){



        cout << B << endl;



    }else{

        cout << A << endl;

    }

}


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



int main(){

	char a[3];

	scanf("%s",a);

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

		a[1]='R';

	}

	else{

		a[1]='B';

	}

	printf("%s",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 cout << "ABC" << endl;

}

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



int main(){

	char a[3];

	scanf("%s",a);

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

		a[1]='R';

	}

	else{

		a[1]='B';

	}

	printf("%s",a);

	return 0;

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

using namespace std;



main()

{

    string s;



    cin >> s;



    if(s == "ABC")

         cout <<"ARC";

    else

        cout <<"ABC";

}


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



int main(){

	char a[3];

	scanf("%s",a);

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

		a[1]='R';

	}

	else{

		a[1]='B';

	}

	printf("%s",a);

	return 0;

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

#include <algorithm>

#include <vector>

#include <set>

#include <queue>

#include <algorithm>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <iostream>

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

 

#define pb push_back

#define mk make_pair

#define f0(i,b) for(int i=0;i<(b);i++)

#define f1(i,b) for(int i=1;i<=(b);i++)

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

#define sf(a) scanf("%d",&a);

#define sfl(a) scanf("%lld",&a);

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

#define pfl(a) printf("%lld\n",a);

#define TEST int test; cin >> test;while(test--)

#define ii pair<int,int>

#define iil pair<ll,ll>

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

#define INF 2147483647

 

 

int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};

int dy8[] = {1,-1, 1, -1, 0, 0, -1, 1};

int dx4[] = {0, 0, 1, -1};

int dy4[] = {1, -1, 0, 0};

const double pi = acos(-1.0);

 

 

void solve()

{

   string s;

   cin >> s;

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

   else cout <<"ABC" <<endl;

}

 

int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(NULL);

    cout.tie(NULL);

    //freopen("input.txt", "r", stdin);

    //freopen("output.txt", "w", stdout);

    //TEST

    solve();

    return 0;

}

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



int main(){

	char a[3];

	scanf("%s",a);

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

		a[1]='R';

	}

	else{

		a[1]='B';

	}

	printf("%s",a);

	return 0;

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

using namespace std;

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



int main(){

	char a[3];

	scanf("%s",a);

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

		a[1]='R';

	}

	else{

		a[1]='B';

	}

	printf("%s",a);

	return 0;

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

#define pb push_back

#define ff first;

#define ss second;

#define ii pair<int,int>

#define vi vector<int>

#define vii vector<ii>

#define lli long long int

#define INF 1000000000

#define endl '\n'

const double pi = 3.141592653589793238460;

typedef std::complex<double> Complex;

typedef std::valarray<Complex> CArray;

using namespace std;

	

int main(){

	ios::sync_with_stdio(0);

	cin.tie(0);

	string n;

	cin >> n;

	if(n=="ABC"){

		cout << "ARC" << endl;

	}

	else{

		cout << "ABC" << endl;

	}

	

	

	return 0;

}




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



int main(){

	char a[3];

	scanf("%s",a);

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

		a[1]='R';

	}

	else{

		a[1]='B';

	}

	printf("%s",a);

	return 0;

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

using namespace std;

int main()

{

    string str;

    while(cin>>str)

    {

        if(str=="ABC")

        {

            cout<<"ARC"<<endl;

        }

        else if(str=="ARC")

        {

            cout<<"ABC"<<endl;

        }

    }

}


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



int main(){

	char a[3];

	scanf("%s",a);

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

		a[1]='R';

	}

	else{

		a[1]='B';

	}

	printf("%s",a);

	return 0;

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

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

using namespace std;

typedef long long ll;

const int maxn = 1e5 + 5;

const int inf = ~0u >> 1;

int main() {

    IO;

    string s;

    cin >> s;

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

    return 0;

}

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

#include <string.h>



int main () {

	char ans[5];

	

	scanf ("%s",ans);

	

		if (!strcmp ("ARC", ans)) {

			printf ("ABC\n");

		}

		if (!strcmp ("ABC", ans)) {

			printf ("ARC\n");

		}

	

	return 0;

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

#define eps 1e-3

#define pi acos(-1.0)

#define inf 0x3f

#define INF 0x3f3f3f3f

#define pb push_back

#define debug1 cout<<"&&";

#define debug2 cout<<"**";

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

#define for0(i, n) for(int i = 0; i < n; ++i)

#define for1(i, n) for(int i = 1; i <= n; ++i)

using namespace std;

typedef double db;

typedef long long ll;

typedef unsigned long long ull;

typedef pair<int, int> pii;

typedef pair<long long, int> pli;

typedef pair<long long, long long> pll;

const int mod = 1e9 + 7;

const int N = 1e5+10;

const int M = 1e6+10;

/*=================================================================================*/



string s;

int main() {

   cin>>s;

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

   else puts("ABC");

}

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

#include <string.h>



int main () {

	char ans[5];

	

	scanf ("%s",ans);

	

		if (!strcmp ("ARC", ans)) {

			printf ("ABC\n");

		}

		if (!strcmp ("ABC", ans)) {

			printf ("ARC\n");

		}

	

	return 0;

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

using namespace std;



int main() {



    string A,B,X;



    A="ABC";

    B="ARC";



    cin>>X;



    if( X == A ){



        cout << B << endl;



    }else{

        cout << A << endl;

    }

}


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

#include <string.h>



int main () {

	char ans[5];

	

	scanf ("%s",ans);

	

		if (!strcmp ("ARC", ans)) {

			printf ("ABC\n");

		}

		if (!strcmp ("ABC", ans)) {

			printf ("ARC\n");

		}

	

	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 cout << "ABC" << endl;

}

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

#include <string.h>



int main () {

	char ans[5];

	

	scanf ("%s",ans);

	

		if (!strcmp ("ARC", ans)) {

			printf ("ABC\n");

		}

		if (!strcmp ("ABC", ans)) {

			printf ("ARC\n");

		}

	

	return 0;

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

using namespace std;



main()

{

    string s;



    cin >> s;



    if(s == "ABC")

         cout <<"ARC";

    else

        cout <<"ABC";

}


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

#include <string.h>



int main () {

	char ans[5];

	

	scanf ("%s",ans);

	

		if (!strcmp ("ARC", ans)) {

			printf ("ABC\n");

		}

		if (!strcmp ("ABC", ans)) {

			printf ("ARC\n");

		}

	

	return 0;

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

#include <algorithm>

#include <vector>

#include <set>

#include <queue>

#include <algorithm>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <iostream>

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

 

#define pb push_back

#define mk make_pair

#define f0(i,b) for(int i=0;i<(b);i++)

#define f1(i,b) for(int i=1;i<=(b);i++)

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

#define sf(a) scanf("%d",&a);

#define sfl(a) scanf("%lld",&a);

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

#define pfl(a) printf("%lld\n",a);

#define TEST int test; cin >> test;while(test--)

#define ii pair<int,int>

#define iil pair<ll,ll>

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

#define INF 2147483647

 

 

int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};

int dy8[] = {1,-1, 1, -1, 0, 0, -1, 1};

int dx4[] = {0, 0, 1, -1};

int dy4[] = {1, -1, 0, 0};

const double pi = acos(-1.0);

 

 

void solve()

{

   string s;

   cin >> s;

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

   else cout <<"ABC" <<endl;

}

 

int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(NULL);

    cout.tie(NULL);

    //freopen("input.txt", "r", stdin);

    //freopen("output.txt", "w", stdout);

    //TEST

    solve();

    return 0;

}

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

#include <string.h>



int main () {

	char ans[5];

	

	scanf ("%s",ans);

	

		if (!strcmp ("ARC", ans)) {

			printf ("ABC\n");

		}

		if (!strcmp ("ABC", ans)) {

			printf ("ARC\n");

		}

	

	return 0;

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

using namespace std;

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

#include <string.h>



int main () {

	char ans[5];

	

	scanf ("%s",ans);

	

		if (!strcmp ("ARC", ans)) {

			printf ("ABC\n");

		}

		if (!strcmp ("ABC", ans)) {

			printf ("ARC\n");

		}

	

	return 0;

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

#define pb push_back

#define ff first;

#define ss second;

#define ii pair<int,int>

#define vi vector<int>

#define vii vector<ii>

#define lli long long int

#define INF 1000000000

#define endl '\n'

const double pi = 3.141592653589793238460;

typedef std::complex<double> Complex;

typedef std::valarray<Complex> CArray;

using namespace std;

	

int main(){

	ios::sync_with_stdio(0);

	cin.tie(0);

	string n;

	cin >> n;

	if(n=="ABC"){

		cout << "ARC" << endl;

	}

	else{

		cout << "ABC" << endl;

	}

	

	

	return 0;

}




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

#include <string.h>



int main () {

	char ans[5];

	

	scanf ("%s",ans);

	

		if (!strcmp ("ARC", ans)) {

			printf ("ABC\n");

		}

		if (!strcmp ("ABC", ans)) {

			printf ("ARC\n");

		}

	

	return 0;

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

using namespace std;

int main()

{

    string str;

    while(cin>>str)

    {

        if(str=="ABC")

        {

            cout<<"ARC"<<endl;

        }

        else if(str=="ARC")

        {

            cout<<"ABC"<<endl;

        }

    }

}


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

#include <string.h>



int main () {

	char ans[5];

	

	scanf ("%s",ans);

	

		if (!strcmp ("ARC", ans)) {

			printf ("ABC\n");

		}

		if (!strcmp ("ABC", ans)) {

			printf ("ARC\n");

		}

	

	return 0;

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

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

using namespace std;

typedef long long ll;

const int maxn = 1e5 + 5;

const int inf = ~0u >> 1;

int main() {

    IO;

    string s;

    cin >> s;

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

    return 0;

}

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



int main()

{

	char str[100];

	scanf("%s", str);

	

	switch (str[1])

	{

		case 'B': printf("ARC\n");

		break;

		case 'R': printf("ABC\n");

		break;

	}

	

	return 0;

}