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



using namespace std;

#define ll long long int

#define f(i,n) for(auto i=0;i<n;i++)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define vi vector<int>

#define pb push_back

#define pr pair<ll, ll>



class triplet{

    ll f,s,t;

};



int main(){

   ll A,B,C;

   cin>>A>>B;

   cout<<6-A-B;

}

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

int main (){

	

	int A, B;

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

	printf("%d\n", 6 - A - B);



	return 0;

	

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

using namespace std;



int main() {

    int a,b;

    cin>>a>>b;

    if((a==1 && b==2)|| (a==2 &&b==1))

        cout<<"3";

    else if((a==1 && b==3)|| (a==3 &&b==1))

        cout<<"2";

    else

        cout<<"1";

}


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

int main (){

	

	int A, B;

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

	printf("%d\n", 6 - A - B);



	return 0;

	

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

#include <cstdio>

#include <cstring>

#include <cmath>

#include <cstring>

#include <chrono>

#include <complex>

#define endl "\n"

#define ll long long int

#define vi vector<int>

#define vll vector<ll>

#define vvi vector < vi >

#define pii pair<int,int>

#define pll pair<long long, long long>

#define mod 1000000007

#define inf 1000000000000000001;

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

#define mp(x,y) make_pair(x,y)

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

#define eb emplace_back

#define f first

#define s second



using namespace std;

int a,b;



int main(){

    cin>>a>>b;

    if(a+b==3){

        cout<<3;

    }

    else if(a+b==4){

        cout<<2;

    }

    else{

        cout<<1;

    }

}


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

int main (){

	

	int A, B;

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

	printf("%d\n", 6 - A - B);



	return 0;

	

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

using namespace std;



int main()

{

    int a, b;

    cin >> a >> b;



    if((a == 2 && b == 3) || (a == 3 && b == 2))

        cout << 1 << endl;



    else if((a == 1 && b == 3) || (a == 3 && b == 1))

        cout << 2 << endl;



    else if((a == 1 && b == 2) || (a == 2 && b == 1))

        cout << 3 << endl;



    return 0;

}


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



int main(){

	char A, B;

	

	scanf("%c\n %c", &A, &B);

	

	if (A== '1'&&B=='2'){

		printf("3");

	}else if (A=='1'&&B=='3'){

		printf("2");

	}else if(A=='3'&&B=='1'){

		printf("2");

	}else if (A=='3'&&B=='2'){

		printf("1");

	}else if (A=='2'&&B=='1'){

		printf("3");

	}else if (A=='2'&&B=='3'){

		printf("1");

	}

	

	

	

	

	return 0;

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

#define fastio() ios_base::sync_with_stdio(false);

using namespace std;

typedef long long ll;





int main(){

	set<int> t;

	int a; cin >> a; t.insert(a);

	cin >> a; t.insert(a);

	for(int i = 1; i<=3; i++) if (t.count(i)==0) {cout << i << endl; return 0;}

	

	return 0;

}


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



int main(){

	char A, B;

	

	scanf("%c\n %c", &A, &B);

	

	if (A== '1'&&B=='2'){

		printf("3");

	}else if (A=='1'&&B=='3'){

		printf("2");

	}else if(A=='3'&&B=='1'){

		printf("2");

	}else if (A=='3'&&B=='2'){

		printf("1");

	}else if (A=='2'&&B=='1'){

		printf("3");

	}else if (A=='2'&&B=='3'){

		printf("1");

	}

	

	

	

	

	return 0;

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

#define ll long long

#define mod 1000000007

#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

#define v(x) vector<int> x;

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

#define s(x,n) memset(x,n,sizeof(x));

#define pb(x) push_back(x)



using namespace std;

int main()

{   fast 

    ll a,b;

    set<ll> s;

    s.insert(1);s.insert(2);s.insert(3);

    cin>>a>>b;

    s.erase(a);s.erase(b);

    auto it=s.begin();

    cout<<*it<<"\n";

    return 0;

}

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



int main(){

	char A, B;

	

	scanf("%c\n %c", &A, &B);

	

	if (A== '1'&&B=='2'){

		printf("3");

	}else if (A=='1'&&B=='3'){

		printf("2");

	}else if(A=='3'&&B=='1'){

		printf("2");

	}else if (A=='3'&&B=='2'){

		printf("1");

	}else if (A=='2'&&B=='1'){

		printf("3");

	}else if (A=='2'&&B=='3'){

		printf("1");

	}

	

	

	

	

	return 0;

}
// Slower C++ solution:
// Optimise

#include <bits/stdc++.h>

using namespace std;



#ifdef LOCAL

#include "/home/shahraaz/bin/debug.h"

#else

#define db(...)

#endif



using ll = long long;

#define f first

#define s second

#define pb push_back

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



const int NAX = 2e5 + 5, MOD = 1000000007;



class Solution

{

private:

public:

    Solution() {}

    ~Solution() {}

    void solveCase()

    {

        int a, b;

        cin >> a >> b;

        cout << 6 - a - b << '\n';

    }

};



int32_t main()

{

#ifndef LOCAL

    ios_base::sync_with_stdio(0);

    cin.tie(0);

#endif

    int t = 1;

    // cin >> t;

    Solution mySolver;

    for (int i = 1; i <= t; ++i)

    {

        mySolver.solveCase();

#ifdef LOCAL

        cerr << "Case #" << i << ": Time " << chrono::duration<double>(chrono::steady_clock::now() - TimeStart).count() << " s.\n";

        TimeStart = chrono::steady_clock::now();

#endif

    }

    return 0;

}


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



int main(){

	char A, B;

	

	scanf("%c\n %c", &A, &B);

	

	if (A== '1'&&B=='2'){

		printf("3");

	}else if (A=='1'&&B=='3'){

		printf("2");

	}else if(A=='3'&&B=='1'){

		printf("2");

	}else if (A=='3'&&B=='2'){

		printf("1");

	}else if (A=='2'&&B=='1'){

		printf("3");

	}else if (A=='2'&&B=='3'){

		printf("1");

	}

	

	

	

	

	return 0;

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

using namespace std;

int main()

{

    int a,b,c;

    cin >> a >> b;

    if(a==1 && b==2)

        cout << "3" << endl;

    else if(a==2 && b==1)

        cout << "3" << endl;

    else if(a==2 && b==3)

        cout << "1" << endl;

    else if(a==3 && b==2)

        cout << "1" << endl;

    else if(a==1 && b==3)

        cout << "2" << endl;

    else if(a==3 && b==1)

        cout << "2" << endl;

    return 0;



}


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



int main(){

	char A, B;

	

	scanf("%c\n %c", &A, &B);

	

	if (A== '1'&&B=='2'){

		printf("3");

	}else if (A=='1'&&B=='3'){

		printf("2");

	}else if(A=='3'&&B=='1'){

		printf("2");

	}else if (A=='3'&&B=='2'){

		printf("1");

	}else if (A=='2'&&B=='1'){

		printf("3");

	}else if (A=='2'&&B=='3'){

		printf("1");

	}

	

	

	

	

	return 0;

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

using namespace std;

int main()

{

    int a,b;



    cin >> a >> b;



    if(a==1&&b==2||a==2&&b==1)

        cout<<3<<endl;

    else if(a==2&&b==3||a==3&&b==2)

        cout<<1<<endl;

    else if(a==1&&b==3||a==3&&b==1)

        cout<<2<<endl;

    else

    return 0;

}


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



int main(){

	char A, B;

	

	scanf("%c\n %c", &A, &B);

	

	if (A== '1'&&B=='2'){

		printf("3");

	}else if (A=='1'&&B=='3'){

		printf("2");

	}else if(A=='3'&&B=='1'){

		printf("2");

	}else if (A=='3'&&B=='2'){

		printf("1");

	}else if (A=='2'&&B=='1'){

		printf("3");

	}else if (A=='2'&&B=='3'){

		printf("1");

	}

	

	

	

	

	return 0;

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

using namespace std;

//h3h3

int a,b;

int main() {

cin>>a>>b;

cout<<6-a-b;

}

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



int main(){

	char A, B;

	

	scanf("%c\n %c", &A, &B);

	

	if (A== '1'&&B=='2'){

		printf("3");

	}else if (A=='1'&&B=='3'){

		printf("2");

	}else if(A=='3'&&B=='1'){

		printf("2");

	}else if (A=='3'&&B=='2'){

		printf("1");

	}else if (A=='2'&&B=='1'){

		printf("3");

	}else if (A=='2'&&B=='3'){

		printf("1");

	}

	

	

	

	

	return 0;

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

using namespace std;







int main()

{

int a,b;

cin >> a >> b;

int x= a+b;

if(x==3){

    cout << "3";

}else if (x==4){

    cout << "2";

}else if (x==5){

    cout << "1";

}

}




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



int main(){

	char A, B;

	

	scanf("%c\n %c", &A, &B);

	

	if (A== '1'&&B=='2'){

		printf("3");

	}else if (A=='1'&&B=='3'){

		printf("2");

	}else if(A=='3'&&B=='1'){

		printf("2");

	}else if (A=='3'&&B=='2'){

		printf("1");

	}else if (A=='2'&&B=='1'){

		printf("3");

	}else if (A=='2'&&B=='3'){

		printf("1");

	}

	

	

	

	

	return 0;

}
// Slower C++ solution:
/// --- In the name of ALLAH --- ///





#include <cmath>

#include<bits/stdc++.h>

using namespace std;





typedef long long              ll;

typedef vector<int>            vi;

typedef vector<ll>             vl;

typedef vector<vi>             vvi;

typedef vector<vl>             vvl;

typedef pair<int,int>          pii;

typedef pair<double, double>   pdd;

typedef pair<ll, ll>           pll;

typedef vector<pii>            vii;

typedef vector<pll>            vll;

typedef double                 dl;



#define endl                   '\n'

#define PB                     push_back

#define F                      first

#define S                      second

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

#define rall(a)                (a).rbegin(),(a).rend()

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

#define wt                     ll t; cin>>t; while(t--)

#define input(a,n)             for(int i=0;i<n;i++) cin>>a[i];



const double PI = acos(-1);

const double eps = 1e-9;

const int inf = 2000000000;

const ll infLL = 9000000000000000000;





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

#define sqr(a) ((a) * (a))

#define mod 10000007

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

#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);

#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);



#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)

void faltu () {            cerr << endl;}

template < typename T, typename ... hello>void faltu( T arg, const hello &... rest) {cerr << arg << ' ';faltu(rest...);}



ll gcd ( ll a, ll b ) { return __gcd ( a, b ); }

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





const ll mx=1e9;



















int main()

{

    optimize();

int a,b;

cin>>a>>b;



if((a==1&&b==2)||(a==2&&b==1))

    cout<<3<<endl;

else if((a==1&&b==3)||(a==3&&b==1))

    cout<<2<<endl;

else if((a==3&&b==2)||(a==2&&b==3))

    cout<<1<<endl;









    return 0;

}
















































































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



int main(){

	char A, B;

	

	scanf("%c\n %c", &A, &B);

	

	if (A== '1'&&B=='2'){

		printf("3");

	}else if (A=='1'&&B=='3'){

		printf("2");

	}else if(A=='3'&&B=='1'){

		printf("2");

	}else if (A=='3'&&B=='2'){

		printf("1");

	}else if (A=='2'&&B=='1'){

		printf("3");

	}else if (A=='2'&&B=='3'){

		printf("1");

	}

	

	

	

	

	return 0;

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

using namespace std;

int main()

{

   int A,B;

   cin>>A>>B;

   if((A==1 && B==2)||(A==2 && B==1))

   {

       cout<<"3";

   }

   else if((A==1 && B==3)||(A==3 && B==1))

   {

       cout<<"2";

   }

    else if((A==2 && B==3)||(A==3 && B==2))

   {

       cout<<"1";

   }

}


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



int main(){

	char A, B;

	

	scanf("%c\n %c", &A, &B);

	

	if (A== '1'&&B=='2'){

		printf("3");

	}else if (A=='1'&&B=='3'){

		printf("2");

	}else if(A=='3'&&B=='1'){

		printf("2");

	}else if (A=='3'&&B=='2'){

		printf("1");

	}else if (A=='2'&&B=='1'){

		printf("3");

	}else if (A=='2'&&B=='3'){

		printf("1");

	}

	

	

	

	

	return 0;

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

using namespace std;

int a,b;



int main(){

    cin>>a>>b;

    if(a+b==3){

        cout<<3;

    }

    else if(a+b==4){

        cout<<2;

    }

    else{

        cout<<1;

    }

}

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



int main(){

	char A, B;

	

	scanf("%c\n %c", &A, &B);

	

	if (A== '1'&&B=='2'){

		printf("3");

	}else if (A=='1'&&B=='3'){

		printf("2");

	}else if(A=='3'&&B=='1'){

		printf("2");

	}else if (A=='3'&&B=='2'){

		printf("1");

	}else if (A=='2'&&B=='1'){

		printf("3");

	}else if (A=='2'&&B=='3'){

		printf("1");

	}

	

	

	

	

	return 0;

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

using namespace std;



int main()

{

    int a, b;

    cin >> a >> b;



    if((a == 2 && b == 3) || (a == 3 && b == 2))

        cout << 1 << endl;



    else if((a == 1 && b == 3) || (a == 3 && b == 1))

        cout << 2 << endl;



    else if((a == 1 && b == 2) || (a == 2 && b == 1))

        cout << 3 << endl;



    return 0;

}


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

int main ()

{

	int A, B;

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

	printf("%d\n", 6 - A - B);

return 0; 

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

#define fastio() ios_base::sync_with_stdio(false);

using namespace std;

typedef long long ll;





int main(){

	set<int> t;

	int a; cin >> a; t.insert(a);

	cin >> a; t.insert(a);

	for(int i = 1; i<=3; i++) if (t.count(i)==0) {cout << i << endl; return 0;}

	

	return 0;

}


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

int main ()

{

	int A, B;

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

	printf("%d\n", 6 - A - B);

return 0; 

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

#define ll long long

#define mod 1000000007

#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

#define v(x) vector<int> x;

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

#define s(x,n) memset(x,n,sizeof(x));

#define pb(x) push_back(x)



using namespace std;

int main()

{   fast 

    ll a,b;

    set<ll> s;

    s.insert(1);s.insert(2);s.insert(3);

    cin>>a>>b;

    s.erase(a);s.erase(b);

    auto it=s.begin();

    cout<<*it<<"\n";

    return 0;

}

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

int main ()

{

	int A, B;

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

	printf("%d\n", 6 - A - B);

return 0; 

}
// Slower C++ solution:
// Optimise

#include <bits/stdc++.h>

using namespace std;



#ifdef LOCAL

#include "/home/shahraaz/bin/debug.h"

#else

#define db(...)

#endif



using ll = long long;

#define f first

#define s second

#define pb push_back

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



const int NAX = 2e5 + 5, MOD = 1000000007;



class Solution

{

private:

public:

    Solution() {}

    ~Solution() {}

    void solveCase()

    {

        int a, b;

        cin >> a >> b;

        cout << 6 - a - b << '\n';

    }

};



int32_t main()

{

#ifndef LOCAL

    ios_base::sync_with_stdio(0);

    cin.tie(0);

#endif

    int t = 1;

    // cin >> t;

    Solution mySolver;

    for (int i = 1; i <= t; ++i)

    {

        mySolver.solveCase();

#ifdef LOCAL

        cerr << "Case #" << i << ": Time " << chrono::duration<double>(chrono::steady_clock::now() - TimeStart).count() << " s.\n";

        TimeStart = chrono::steady_clock::now();

#endif

    }

    return 0;

}


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

int main ()

{

	int A, B;

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

	printf("%d\n", 6 - A - B);

return 0; 

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

using namespace std;

int main()

{

    int a,b,c;

    cin >> a >> b;

    if(a==1 && b==2)

        cout << "3" << endl;

    else if(a==2 && b==1)

        cout << "3" << endl;

    else if(a==2 && b==3)

        cout << "1" << endl;

    else if(a==3 && b==2)

        cout << "1" << endl;

    else if(a==1 && b==3)

        cout << "2" << endl;

    else if(a==3 && b==1)

        cout << "2" << endl;

    return 0;



}


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

int main ()

{

	int A, B;

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

	printf("%d\n", 6 - A - B);

return 0; 

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

using namespace std;

int main()

{

    int a,b;



    cin >> a >> b;



    if(a==1&&b==2||a==2&&b==1)

        cout<<3<<endl;

    else if(a==2&&b==3||a==3&&b==2)

        cout<<1<<endl;

    else if(a==1&&b==3||a==3&&b==1)

        cout<<2<<endl;

    else

    return 0;

}


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

int main ()

{

	int A, B;

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

	printf("%d\n", 6 - A - B);

return 0; 

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

using namespace std;

//h3h3

int a,b;

int main() {

cin>>a>>b;

cout<<6-a-b;

}

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

int main ()

{

	int A, B;

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

	printf("%d\n", 6 - A - B);

return 0; 

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

using namespace std;







int main()

{

int a,b;

cin >> a >> b;

int x= a+b;

if(x==3){

    cout << "3";

}else if (x==4){

    cout << "2";

}else if (x==5){

    cout << "1";

}

}




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

int main ()

{

	int A, B;

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

	printf("%d\n", 6 - A - B);

return 0; 

}
// Slower C++ solution:
/// --- In the name of ALLAH --- ///





#include <cmath>

#include<bits/stdc++.h>

using namespace std;





typedef long long              ll;

typedef vector<int>            vi;

typedef vector<ll>             vl;

typedef vector<vi>             vvi;

typedef vector<vl>             vvl;

typedef pair<int,int>          pii;

typedef pair<double, double>   pdd;

typedef pair<ll, ll>           pll;

typedef vector<pii>            vii;

typedef vector<pll>            vll;

typedef double                 dl;



#define endl                   '\n'

#define PB                     push_back

#define F                      first

#define S                      second

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

#define rall(a)                (a).rbegin(),(a).rend()

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

#define wt                     ll t; cin>>t; while(t--)

#define input(a,n)             for(int i=0;i<n;i++) cin>>a[i];



const double PI = acos(-1);

const double eps = 1e-9;

const int inf = 2000000000;

const ll infLL = 9000000000000000000;





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

#define sqr(a) ((a) * (a))

#define mod 10000007

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

#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);

#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);



#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)

void faltu () {            cerr << endl;}

template < typename T, typename ... hello>void faltu( T arg, const hello &... rest) {cerr << arg << ' ';faltu(rest...);}



ll gcd ( ll a, ll b ) { return __gcd ( a, b ); }

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





const ll mx=1e9;



















int main()

{

    optimize();

int a,b;

cin>>a>>b;



if((a==1&&b==2)||(a==2&&b==1))

    cout<<3<<endl;

else if((a==1&&b==3)||(a==3&&b==1))

    cout<<2<<endl;

else if((a==3&&b==2)||(a==2&&b==3))

    cout<<1<<endl;









    return 0;

}
















































































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

int main ()

{

	int A, B;

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

	printf("%d\n", 6 - A - B);

return 0; 

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

using namespace std;

int main()

{

   int A,B;

   cin>>A>>B;

   if((A==1 && B==2)||(A==2 && B==1))

   {

       cout<<"3";

   }

   else if((A==1 && B==3)||(A==3 && B==1))

   {

       cout<<"2";

   }

    else if((A==2 && B==3)||(A==3 && B==2))

   {

       cout<<"1";

   }

}


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

int main ()

{

	int A, B;

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

	printf("%d\n", 6 - A - B);

return 0; 

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

using namespace std;

int a,b;



int main(){

    cin>>a>>b;

    if(a+b==3){

        cout<<3;

    }

    else if(a+b==4){

        cout<<2;

    }

    else{

        cout<<1;

    }

}

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

int main ()

{

	int A, B;

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

	printf("%d\n", 6 - A - B);

return 0; 

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

using namespace std;



int main()

{

    int a, b;

    cin >> a >> b;



    if((a == 2 && b == 3) || (a == 3 && b == 2))

        cout << 1 << endl;



    else if((a == 1 && b == 3) || (a == 3 && b == 1))

        cout << 2 << endl;



    else if((a == 1 && b == 2) || (a == 2 && b == 1))

        cout << 3 << endl;



    return 0;

}


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



int main()

{

    int A, B;

    scanf("%d", &A);

    scanf("%d", &B);

    

    if ((A == 1 && B == 2) || (A == 2 && B == 1)) {

        printf("3");

    }

    if ((A == 1 && B == 3) || (A == 3 && B == 1)) {

        printf("2");

    }

    if ((A == 2 && B == 3) || (A == 3 && B == 2)){

        printf("1");

    }



    return 0;



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

#define fastio() ios_base::sync_with_stdio(false);

using namespace std;

typedef long long ll;





int main(){

	set<int> t;

	int a; cin >> a; t.insert(a);

	cin >> a; t.insert(a);

	for(int i = 1; i<=3; i++) if (t.count(i)==0) {cout << i << endl; return 0;}

	

	return 0;

}


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



int main()

{

    int A, B;

    scanf("%d", &A);

    scanf("%d", &B);

    

    if ((A == 1 && B == 2) || (A == 2 && B == 1)) {

        printf("3");

    }

    if ((A == 1 && B == 3) || (A == 3 && B == 1)) {

        printf("2");

    }

    if ((A == 2 && B == 3) || (A == 3 && B == 2)){

        printf("1");

    }



    return 0;



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

#define ll long long

#define mod 1000000007

#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

#define v(x) vector<int> x;

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

#define s(x,n) memset(x,n,sizeof(x));

#define pb(x) push_back(x)



using namespace std;

int main()

{   fast 

    ll a,b;

    set<ll> s;

    s.insert(1);s.insert(2);s.insert(3);

    cin>>a>>b;

    s.erase(a);s.erase(b);

    auto it=s.begin();

    cout<<*it<<"\n";

    return 0;

}

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



int main()

{

    int A, B;

    scanf("%d", &A);

    scanf("%d", &B);

    

    if ((A == 1 && B == 2) || (A == 2 && B == 1)) {

        printf("3");

    }

    if ((A == 1 && B == 3) || (A == 3 && B == 1)) {

        printf("2");

    }

    if ((A == 2 && B == 3) || (A == 3 && B == 2)){

        printf("1");

    }



    return 0;



}