stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
// Created by Bingoo on 7/8/2020.

#include"bits/stdc++.h"

using namespace std ;

#define ll  long long

#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



template <class ...Args>

auto &see(const Args &...args) {return ((cerr << " " << args), ...) << '\n';}

#define bug(...)  cerr << "[ "#__VA_ARGS__" ] = "; see(__VA_ARGS__) << '\n';

//C++17

template<typename... Args>

void read(Args&... args){((cin >> args), ...);}

template<typename... Args>

void write(Args... args){((cout << args << " "), ...);}



ll mod = 1e6 +3 ;

ll power(ll a, ll b)	//a is base, b is exponent

{

    if (b == 0)

        return 1;

    if (b == 1)

        return a;

    if (b % 2 == 1)

        return (power(a, b - 1) * a) % mod;

    ll q = power(a, b / 2);

    return (q * q) % mod;

}



bool comp(pair<int,int>&a ,pair<int,int>&b)

{

    return a.second > b.second ;

}



string s;

int k ,n ;



int main(){

    cin >> n >> k >> s ;



   s[k-1]=tolower(s[k-1]);



   cout << s << endl;





}






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



int main () {

    int N,K ;

    char nama[55];

    scanf("%d%d %s",&N,&K,nama);

    nama[K-1]= nama[K-1]+32;

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

    return 0;



}
// Slower C++ solution:
// Created by Bingoo on 7/8/2020.

#include"bits/stdc++.h"

using namespace std ;

#define ll  long long

#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



template <class ...Args>

auto &see(const Args &...args) {return ((cerr << " " << args), ...) << '\n';}

#define bug(...)  cerr << "[ "#__VA_ARGS__" ] = "; see(__VA_ARGS__) << '\n';

//C++17

template<typename... Args>

void read(Args&... args){((cin >> args), ...);}

template<typename... Args>

void write(Args... args){((cout << args << " "), ...);}



ll mod = 1e6 +3 ;

ll power(ll a, ll b)	//a is base, b is exponent

{

    if (b == 0)

        return 1;

    if (b == 1)

        return a;

    if (b % 2 == 1)

        return (power(a, b - 1) * a) % mod;

    ll q = power(a, b / 2);

    return (q * q) % mod;

}



bool comp(pair<int,int>&a ,pair<int,int>&b)

{

    return a.second > b.second ;

}



string s;

int k ,n ;



int main(){

    cin >> n >> k >> s ;



   s[k-1]=tolower(s[k-1]);



   cout << s << endl;





}






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



int main(){

	int N;

	int K;

	char name[50];

	

	scanf("%d %d", &N, &K);

	scanf("%s", &name);



	int B = K-1;

	int C = name[B]+32;

	

	name[B] = C;

	

	printf("%s", name);

	

	

	

	return 0;

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

#define taskname "abc126_a"

using namespace std;



main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(nullptr);   cout.tie(nullptr);

    if (ifstream("test.inp"))

    {

        freopen("test.inp", "r", stdin);

        #ifdef CHECKING

            freopen(taskname".out", "w", stdout);

        #else

            freopen("test.out", "w", stdout);

        #endif //CHECKING

    }

    else if (ifstream(taskname".inp"))

    {

        freopen(taskname".inp", "r", stdin);

        freopen(taskname".out", "w", stdout);

    }



    int n, k;

    string s;

    cin >> n >> k >> s;

    if (s[k-1] < 97) s[k-1] += 32;

    cout << s;

}


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



int main() {

	int n,k;

	scanf("%d %d", &n, &k);

	char s[n+1];

	scanf("%s", s);

	s[k-1] += 32;

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

	

	

	return 0;

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

#define taskname "abc126_a"

using namespace std;



main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(nullptr);   cout.tie(nullptr);

    if (ifstream("test.inp"))

    {

        freopen("test.inp", "r", stdin);

        #ifdef CHECKING

            freopen(taskname".out", "w", stdout);

        #else

            freopen("test.out", "w", stdout);

        #endif //CHECKING

    }

    else if (ifstream(taskname".inp"))

    {

        freopen(taskname".inp", "r", stdin);

        freopen(taskname".out", "w", stdout);

    }



    int n, k;

    string s;

    cin >> n >> k >> s;

    if (s[k-1] < 97) s[k-1] += 32;

    cout << s;

}


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



int main(){

	int len,index;

	scanf("%d", &len);

	scanf("%d", &index);

	getchar();

	char name[len];

	scanf("%s",&name);

	name[index-1]+=32;

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

	return 0;

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

#define taskname "abc126_a"

using namespace std;



main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(nullptr);   cout.tie(nullptr);

    if (ifstream("test.inp"))

    {

        freopen("test.inp", "r", stdin);

        #ifdef CHECKING

            freopen(taskname".out", "w", stdout);

        #else

            freopen("test.out", "w", stdout);

        #endif //CHECKING

    }

    else if (ifstream(taskname".inp"))

    {

        freopen(taskname".inp", "r", stdin);

        freopen(taskname".out", "w", stdout);

    }



    int n, k;

    string s;

    cin >> n >> k >> s;

    if (s[k-1] < 97) s[k-1] += 32;

    cout << s;

}


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



int main () {

	int N; 

	int K;

	char S[50];

	int length;

	scanf("%d%d", &N, &K);

	scanf("%s", S);

	length = K - 1;

	S[length] += 32; 

	printf("%s", S);

	return 0;

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

#define taskname "abc126_a"

using namespace std;



main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(nullptr);   cout.tie(nullptr);

    if (ifstream("test.inp"))

    {

        freopen("test.inp", "r", stdin);

        #ifdef CHECKING

            freopen(taskname".out", "w", stdout);

        #else

            freopen("test.out", "w", stdout);

        #endif //CHECKING

    }

    else if (ifstream(taskname".inp"))

    {

        freopen(taskname".inp", "r", stdin);

        freopen(taskname".out", "w", stdout);

    }



    int n, k;

    string s;

    cin >> n >> k >> s;

    if (s[k-1] < 97) s[k-1] += 32;

    cout << s;

}


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

#include <string.h>

int main()

{

	char kata[55];

	int N,index;

	int K;

	

	scanf ("%d %d",&N,&K);

	getchar();

	scanf ("%s",&kata);

	getchar();

	

	kata[K-1] += 32;

	

	printf("%s",kata);

	

	return 0;

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

#define taskname "abc126_a"

using namespace std;



main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(nullptr);   cout.tie(nullptr);

    if (ifstream("test.inp"))

    {

        freopen("test.inp", "r", stdin);

        #ifdef CHECKING

            freopen(taskname".out", "w", stdout);

        #else

            freopen("test.out", "w", stdout);

        #endif //CHECKING

    }

    else if (ifstream(taskname".inp"))

    {

        freopen(taskname".inp", "r", stdin);

        freopen(taskname".out", "w", stdout);

    }



    int n, k;

    string s;

    cin >> n >> k >> s;

    if (s[k-1] < 97) s[k-1] += 32;

    cout << s;

}


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



int main(){

	

	int lenght;

	int index;

	char character [55];

	scanf("%d %d", &lenght, &index);

	getchar();

	scanf("%s", &character);

	character [index-1] += 32;

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

		

	return 0;

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

#define taskname "abc126_a"

using namespace std;



main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(nullptr);   cout.tie(nullptr);

    if (ifstream("test.inp"))

    {

        freopen("test.inp", "r", stdin);

        #ifdef CHECKING

            freopen(taskname".out", "w", stdout);

        #else

            freopen("test.out", "w", stdout);

        #endif //CHECKING

    }

    else if (ifstream(taskname".inp"))

    {

        freopen(taskname".inp", "r", stdin);

        freopen(taskname".out", "w", stdout);

    }



    int n, k;

    string s;

    cin >> n >> k >> s;

    if (s[k-1] < 97) s[k-1] += 32;

    cout << s;

}


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

int main (){



    char strS[52];

    int N;

    int K;



    1<=N<=50;



    1<=K<=N;



    scanf("%d %d", &N, &K);



    scanf("%s", &strS);



    strS[K-1] += 32;



    printf("%s", strS);





    return 0;

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

#define taskname "abc126_a"

using namespace std;



main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(nullptr);   cout.tie(nullptr);

    if (ifstream("test.inp"))

    {

        freopen("test.inp", "r", stdin);

        #ifdef CHECKING

            freopen(taskname".out", "w", stdout);

        #else

            freopen("test.out", "w", stdout);

        #endif //CHECKING

    }

    else if (ifstream(taskname".inp"))

    {

        freopen(taskname".inp", "r", stdin);

        freopen(taskname".out", "w", stdout);

    }



    int n, k;

    string s;

    cin >> n >> k >> s;

    if (s[k-1] < 97) s[k-1] += 32;

    cout << s;

}


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

#include <string.h>



int main() {

	int N;

	int K;

	

	scanf("%d %d", &N, &K);

	char S[100];

	scanf("%s", S);

	S[K-1]+= 32;

	printf("%s", S);

	

	return 0;

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

#define taskname "abc126_a"

using namespace std;



main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(nullptr);   cout.tie(nullptr);

    if (ifstream("test.inp"))

    {

        freopen("test.inp", "r", stdin);

        #ifdef CHECKING

            freopen(taskname".out", "w", stdout);

        #else

            freopen("test.out", "w", stdout);

        #endif //CHECKING

    }

    else if (ifstream(taskname".inp"))

    {

        freopen(taskname".inp", "r", stdin);

        freopen(taskname".out", "w", stdout);

    }



    int n, k;

    string s;

    cin >> n >> k >> s;

    if (s[k-1] < 97) s[k-1] += 32;

    cout << s;

}


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

 

int main() {

	int N, K, A;

	char nama [52];



	scanf("%d %d %d", &N, &K, &A);

	scanf ("%s", &nama);

	A = K-1 ;

	nama [A] = nama [A] + 32 ;



	printf("%s", nama ) ;

	

	return 0;

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

#define taskname "abc126_a"

using namespace std;



main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(nullptr);   cout.tie(nullptr);

    if (ifstream("test.inp"))

    {

        freopen("test.inp", "r", stdin);

        #ifdef CHECKING

            freopen(taskname".out", "w", stdout);

        #else

            freopen("test.out", "w", stdout);

        #endif //CHECKING

    }

    else if (ifstream(taskname".inp"))

    {

        freopen(taskname".inp", "r", stdin);

        freopen(taskname".out", "w", stdout);

    }



    int n, k;

    string s;

    cin >> n >> k >> s;

    if (s[k-1] < 97) s[k-1] += 32;

    cout << s;

}


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



int main(){

	char S [52];

	int N, K;

	scanf("%d %d\n", &N, &K);

	scanf("%s", &S);

	S[K-1] += 32;

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

	

	return 0;

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

#define taskname "abc126_a"

using namespace std;



main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(nullptr);   cout.tie(nullptr);

    if (ifstream("test.inp"))

    {

        freopen("test.inp", "r", stdin);

        #ifdef CHECKING

            freopen(taskname".out", "w", stdout);

        #else

            freopen("test.out", "w", stdout);

        #endif //CHECKING

    }

    else if (ifstream(taskname".inp"))

    {

        freopen(taskname".inp", "r", stdin);

        freopen(taskname".out", "w", stdout);

    }



    int n, k;

    string s;

    cin >> n >> k >> s;

    if (s[k-1] < 97) s[k-1] += 32;

    cout << s;

}


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

int main() {

  

  int N; 

  int K;

  char S[52];

  

  scanf("%d %d", &N, &K);getchar();

  scanf("%s", &S);getchar();

  

  int M = K-1;

  S[M] += 32;

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





  return 0;

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

#define taskname "abc126_a"

using namespace std;



main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(nullptr);   cout.tie(nullptr);

    if (ifstream("test.inp"))

    {

        freopen("test.inp", "r", stdin);

        #ifdef CHECKING

            freopen(taskname".out", "w", stdout);

        #else

            freopen("test.out", "w", stdout);

        #endif //CHECKING

    }

    else if (ifstream(taskname".inp"))

    {

        freopen(taskname".inp", "r", stdin);

        freopen(taskname".out", "w", stdout);

    }



    int n, k;

    string s;

    cin >> n >> k >> s;

    if (s[k-1] < 97) s[k-1] += 32;

    cout << s;

}


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



int main() {

	int A;

	int B;

	char s[55];

	

	scanf("%d %d", &A, &B);

	scanf("%s", s);

	

	s[B-1] += 32;

	

	printf("%s", s);

	

	

	return 0;

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

using namespace std;

int main(){



    string S;

    cin>> S;



    if(S == "ABC"){

        cout<< "ARC";

    }

    else{

        cout<< "ABC";

    }



    return 0;

}


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

#include <string.h>

char s[10];

int main(){

	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;

int main(){

    string s;

    cin >> s;

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

    else cout<<"ABC";

}

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

#include <string.h>

char s[10];

int main(){

	scanf("%s",s);

	if(strcmp(s,"ABC")==0)printf("ARC\n");

	else printf("ABC\n");

	return 0;

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

#include<cstring>

#include<cstdio>

#include<string>

#include<cmath>

#include<algorithm>

#include<map>

#include <cstdlib>

using namespace std;



int main(){

	string s;

	cin>>s;

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

	else cout<<"ABC";

	return 0;

}

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

#include <string.h>

char s[10];

int main(){

	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 S;

    cin>> S;



    if(S == "ABC"){

        cout<< "ARC";

    }

    else{

        cout<< "ABC";

    }



    return 0;

}


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



int main()

{

    char axc[5];

    scanf("%s", &axc);

    switch(axc[1]){

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

            break;

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

            break;

    }

    return 0;

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

using namespace std;

int 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>



int main()

{

    char axc[5];

    scanf("%s", &axc);

    switch(axc[1]){

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

            break;

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

            break;

    }

    return 0;

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

#include<cstring>

#include<cstdio>

#include<string>

#include<cmath>

#include<algorithm>

#include<map>

#include <cstdlib>

using namespace std;



int main(){

	string s;

	cin>>s;

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

	else cout<<"ABC";

	return 0;

}

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



int main()

{

    char axc[5];

    scanf("%s", &axc);

    switch(axc[1]){

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

            break;

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

            break;

    }

    return 0;

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

#include<cstring>

using namespace std;

int main ()

{

    char S[50];

    cin>>S;

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

    cout<<"ARC"<<endl;

    if (strcmp("ARC",S)==0)

    cout<<"ABC"<<endl;

    return 0;

}


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



int main()

{

    char axc[5];

    scanf("%s", &axc);

    switch(axc[1]){

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

            break;

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

            break;

    }

    return 0;

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

using namespace std;

int main() {

    string ss;

    cin>>ss;

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

    	cout<<"ABC";

    }else cout<<"ARC";

    return 0;

}


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



int main()

{

    char axc[5];

    scanf("%s", &axc);

    switch(axc[1]){

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

            break;

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

            break;

    }

    return 0;

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

using namespace std;

int 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>



int main()

{

    char axc[5];

    scanf("%s", &axc);

    switch(axc[1]){

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

            break;

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

            break;

    }

    return 0;

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

using namespace std;

int main(){



    string S;

    cin>> S;



    if(S == "ABC"){

        cout<< "ARC";

    }

    else{

        cout<< "ABC";

    }



    return 0;

}


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

 

int main() {

	char str[4];

	scanf("%s", str);

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

		puts("ARC");		

	}else if(str[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";

    else cout<<"ABC";

}

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

 

int main() {

	char str[4];

	scanf("%s", str);

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

		puts("ARC");		

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

		puts("ABC");

	}

	

	

	return 0;

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

#include<cstring>

#include<cstdio>

#include<string>

#include<cmath>

#include<algorithm>

#include<map>

#include <cstdlib>

using namespace std;



int main(){

	string s;

	cin>>s;

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

	else cout<<"ABC";

	return 0;

}

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

 

int main() {

	char str[4];

	scanf("%s", str);

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

		puts("ARC");		

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

		puts("ABC");

	}

	

	

	return 0;

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

#include<cstring>

using namespace std;

int main ()

{

    char S[50];

    cin>>S;

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

    cout<<"ARC"<<endl;

    if (strcmp("ARC",S)==0)

    cout<<"ABC"<<endl;

    return 0;

}


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

 

int main() {

	char str[4];

	scanf("%s", str);

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

		puts("ARC");		

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

		puts("ABC");

	}

	

	

	return 0;

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

using namespace std;

int main() {

    string ss;

    cin>>ss;

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

    	cout<<"ABC";

    }else cout<<"ARC";

    return 0;

}


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

 

int main() {

	char str[4];

	scanf("%s", str);

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

		puts("ARC");		

	}else if(str[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";

    else

        cout<<"ABC";

}


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

 

int main() {

	char str[4];

	scanf("%s", str);

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

		puts("ARC");		

	}else if(str[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";

    }

    else{

        cout<< "ABC";

    }



    return 0;

}


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

 

int main()

{

	char S[6];

	scanf("%s", &S);

	if(S[1] == 'B') printf("ARC\n");

	else printf("ABC\n");

	return 0;

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

using namespace std;

int 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>

 

int main()

{

	char S[6];

	scanf("%s", &S);

	if(S[1] == 'B') printf("ARC\n");

	else printf("ABC\n");

	return 0;

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

#include<cstring>

#include<cstdio>

#include<string>

#include<cmath>

#include<algorithm>

#include<map>

#include <cstdlib>

using namespace std;



int main(){

	string s;

	cin>>s;

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

	else cout<<"ABC";

	return 0;

}

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

 

int main()

{

	char S[6];

	scanf("%s", &S);

	if(S[1] == 'B') printf("ARC\n");

	else printf("ABC\n");

	return 0;

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

#include<cstring>

using namespace std;

int main ()

{

    char S[50];

    cin>>S;

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

    cout<<"ARC"<<endl;

    if (strcmp("ARC",S)==0)

    cout<<"ABC"<<endl;

    return 0;

}


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

 

int main()

{

	char S[6];

	scanf("%s", &S);

	if(S[1] == 'B') printf("ARC\n");

	else printf("ABC\n");

	return 0;

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

using namespace std;

int main() {

    string ss;

    cin>>ss;

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

    	cout<<"ABC";

    }else cout<<"ARC";

    return 0;

}


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

 

int main()

{

	char S[6];

	scanf("%s", &S);

	if(S[1] == 'B') printf("ARC\n");

	else printf("ABC\n");

	return 0;

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

using namespace std;

int 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>

 

int main()

{

	char S[6];

	scanf("%s", &S);

	if(S[1] == 'B') printf("ARC\n");

	else printf("ABC\n");

	return 0;

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

using namespace std;

int main(){



    string S;

    cin>> S;



    if(S == "ABC"){

        cout<< "ARC";

    }

    else{

        cout<< "ABC";

    }



    return 0;

}


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



int main(){

	char word[10];

	scanf("%s", word);

	

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

	else puts ("ABC");

	return 0;

}