stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:




#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

 

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'

#define mset(d,val) memset(d,val,sizeof(d))

#define setp(x) cout<<fixed<<setprecision(x)

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

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

#define pb push_back

#define mp make_pair

#define F first

#define S second

#define INF ll(1e18)

#define MOD 998244353

#define pqueue priority_queue

#define fbo find_by_order

#define ook order_of_key

typedef long long ll;

typedef pair<ll,ll> ii;

typedef vector<ll> vi;

typedef vector<ii> vii;

typedef long double ld;

typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;

 

#define MAXN 1000000007

 

 

int main() {

	ll a,b,c;

	cin>>a>>b>>c;

	ll d=a-b;

	ll e=b-c;

	ll f=a-c;



	if ((d==0) or(e==0) or(f==0)) {

		if ((d==0) and(e==0) and(f==0)) {

			cout<<"No";

		}

		else {

			cout<<"Yes";



		}

	}

	else {

		cout<<"No";

	}

}

	

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



int main() {

  int a, b, c;

  scanf("%d %d %d", &a, &b, &c);

  if ( (a == b && b != c && a != c) || (a != b && b != c && a == c) || (a != b && b == c && a != c) ) puts("Yes");

  else puts("No");

  return 0;

}
// Slower C++ solution:




#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

 

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'

#define mset(d,val) memset(d,val,sizeof(d))

#define setp(x) cout<<fixed<<setprecision(x)

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

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

#define pb push_back

#define mp make_pair

#define F first

#define S second

#define INF ll(1e18)

#define MOD 998244353

#define pqueue priority_queue

#define fbo find_by_order

#define ook order_of_key

typedef long long ll;

typedef pair<ll,ll> ii;

typedef vector<ll> vi;

typedef vector<ii> vii;

typedef long double ld;

typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;

 

#define MAXN 1000000007

 

 

int main() {

	ll a,b,c;

	cin>>a>>b>>c;

	ll d=a-b;

	ll e=b-c;

	ll f=a-c;



	if ((d==0) or(e==0) or(f==0)) {

		if ((d==0) and(e==0) and(f==0)) {

			cout<<"No";

		}

		else {

			cout<<"Yes";



		}

	}

	else {

		cout<<"No";

	}

}

	

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



int main(){

	int A,B,C;

	

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

		if(A == B && A != C){

			printf("Yes");

		}

		else if(B == C && B != A ){

			printf("Yes");

		}

		else if(C == A && C != B){

			printf("Yes");

		}

		else{

			printf("No");

		}

	return 0;

}
// Slower C++ solution:




#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

 

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'

#define mset(d,val) memset(d,val,sizeof(d))

#define setp(x) cout<<fixed<<setprecision(x)

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

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

#define pb push_back

#define mp make_pair

#define F first

#define S second

#define INF ll(1e18)

#define MOD 998244353

#define pqueue priority_queue

#define fbo find_by_order

#define ook order_of_key

typedef long long ll;

typedef pair<ll,ll> ii;

typedef vector<ll> vi;

typedef vector<ii> vii;

typedef long double ld;

typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;

 

#define MAXN 1000000007

 

 

int main() {

	ll a,b,c;

	cin>>a>>b>>c;

	ll d=a-b;

	ll e=b-c;

	ll f=a-c;



	if ((d==0) or(e==0) or(f==0)) {

		if ((d==0) and(e==0) and(f==0)) {

			cout<<"No";

		}

		else {

			cout<<"Yes";



		}

	}

	else {

		cout<<"No";

	}

}

	

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



int main()

{

	int A, B, C;

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



	(A==B && A==C && B==C) || (A!=B && A!=C && B!=C) ? puts ("No") : puts ("Yes");



	return 0;

}
// Slower C++ solution:




#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

 

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'

#define mset(d,val) memset(d,val,sizeof(d))

#define setp(x) cout<<fixed<<setprecision(x)

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

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

#define pb push_back

#define mp make_pair

#define F first

#define S second

#define INF ll(1e18)

#define MOD 998244353

#define pqueue priority_queue

#define fbo find_by_order

#define ook order_of_key

typedef long long ll;

typedef pair<ll,ll> ii;

typedef vector<ll> vi;

typedef vector<ii> vii;

typedef long double ld;

typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;

 

#define MAXN 1000000007

 

 

int main() {

	ll a,b,c;

	cin>>a>>b>>c;

	ll d=a-b;

	ll e=b-c;

	ll f=a-c;



	if ((d==0) or(e==0) or(f==0)) {

		if ((d==0) and(e==0) and(f==0)) {

			cout<<"No";

		}

		else {

			cout<<"Yes";



		}

	}

	else {

		cout<<"No";

	}

}

	

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

int main(){

	int A;

	int B;

	int C;

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

	

	

	if(A== B &&A!=C&&B!=C){

		printf("Yes");

	}

	else	if(B==C &&B!=A&&C!=A){

	

		printf("Yes");

	}

	else	if(A== C &&A!=B&&C!=B){

		printf("Yes");

	}

		else{

			printf("No");

	}

	

	

	

	return 0;

}
// Slower C++ solution:




#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

 

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'

#define mset(d,val) memset(d,val,sizeof(d))

#define setp(x) cout<<fixed<<setprecision(x)

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

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

#define pb push_back

#define mp make_pair

#define F first

#define S second

#define INF ll(1e18)

#define MOD 998244353

#define pqueue priority_queue

#define fbo find_by_order

#define ook order_of_key

typedef long long ll;

typedef pair<ll,ll> ii;

typedef vector<ll> vi;

typedef vector<ii> vii;

typedef long double ld;

typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;

 

#define MAXN 1000000007

 

 

int main() {

	ll a,b,c;

	cin>>a>>b>>c;

	ll d=a-b;

	ll e=b-c;

	ll f=a-c;



	if ((d==0) or(e==0) or(f==0)) {

		if ((d==0) and(e==0) and(f==0)) {

			cout<<"No";

		}

		else {

			cout<<"Yes";



		}

	}

	else {

		cout<<"No";

	}

}

	

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



int main(){

	int a,b,c;

	scanf("%d%d%d",&a,&b,&c);

	if(a==b && b!=c){

		printf("Yes\n");

	}

		else if(a==c && b!=a){

		printf("Yes\n");

	}

		else if(b==c && a!=b){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

return 0;

}
// Slower C++ solution:




#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

 

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'

#define mset(d,val) memset(d,val,sizeof(d))

#define setp(x) cout<<fixed<<setprecision(x)

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

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

#define pb push_back

#define mp make_pair

#define F first

#define S second

#define INF ll(1e18)

#define MOD 998244353

#define pqueue priority_queue

#define fbo find_by_order

#define ook order_of_key

typedef long long ll;

typedef pair<ll,ll> ii;

typedef vector<ll> vi;

typedef vector<ii> vii;

typedef long double ld;

typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;

 

#define MAXN 1000000007

 

 

int main() {

	ll a,b,c;

	cin>>a>>b>>c;

	ll d=a-b;

	ll e=b-c;

	ll f=a-c;



	if ((d==0) or(e==0) or(f==0)) {

		if ((d==0) and(e==0) and(f==0)) {

			cout<<"No";

		}

		else {

			cout<<"Yes";



		}

	}

	else {

		cout<<"No";

	}

}

	

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



int main()

{

	int a, b, c;

	scanf("%d %d %d", &a, &b, &c);

	if((a==c&&b==a&&b==c) || (a!=c&&b!=a&&b!=c))

	printf("No");

	else

	printf("Yes");

	

	return 0 ;	

}
// Slower C++ solution:




#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

 

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'

#define mset(d,val) memset(d,val,sizeof(d))

#define setp(x) cout<<fixed<<setprecision(x)

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

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

#define pb push_back

#define mp make_pair

#define F first

#define S second

#define INF ll(1e18)

#define MOD 998244353

#define pqueue priority_queue

#define fbo find_by_order

#define ook order_of_key

typedef long long ll;

typedef pair<ll,ll> ii;

typedef vector<ll> vi;

typedef vector<ii> vii;

typedef long double ld;

typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;

 

#define MAXN 1000000007

 

 

int main() {

	ll a,b,c;

	cin>>a>>b>>c;

	ll d=a-b;

	ll e=b-c;

	ll f=a-c;



	if ((d==0) or(e==0) or(f==0)) {

		if ((d==0) and(e==0) and(f==0)) {

			cout<<"No";

		}

		else {

			cout<<"Yes";



		}

	}

	else {

		cout<<"No";

	}

}

	

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

int main(){

	

	int A, B, C;

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

	if(A==B&&B==C&&C==A){

		printf("No\n");	 

	}

	else if(A!=B&&A!=C&&B!=C)

		printf("No\n");

	 else if(A==C&&A!=B&&C!=B)

		printf("Yes\n");

	 else if(A==B&&A!=C&&B!=C)

		printf("Yes");

	 else if(B==C&&B!=A&&C!=A)

		printf("Yes");

	

	

	return 0; 

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

using namespace std;

typedef long long ll;

typedef vector<int> vi;

typedef pair<int, int> ii;

typedef vector<ii> vii;



int main()

{

    int a, b, c; cin >> a >> b >> c;

    if ((a == b || b == c || c == a) && !(a == b && b == c))

        cout << "Yes" << '\n';

    else

        cout << "No" << '\n';

    return 0;

}


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



int main (){



	int a,b,c;

	

	scanf("%d %d %d",&a,&b,&c);



	if(a==b && a!=c && b!=c){

		printf("Yes\n");

	}else if(b==c && b!=a && c!=a){

		printf("Yes\n");

	}else if(a==c && a!=b && c!=b){

		printf("Yes\n");

	}else

		printf("No\n");



return 0;

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

using namespace std;

typedef long long ll;

typedef vector<int> vi;

typedef pair<int, int> ii;

typedef vector<ii> vii;



int main()

{

    int a, b, c; cin >> a >> b >> c;

    if ((a == b || b == c || c == a) && !(a == b && b == c))

        cout << "Yes" << '\n';

    else

        cout << "No" << '\n';

    return 0;

}


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

int main(){

	int a;

	int b;

	int c;

	

	scanf("%d %d %d", &a,&b,&c);

	if(a==b && a!=c && b!=c){

		printf("Yes");

	}

	else if (b==c && b!=a && c!=a){

		printf("Yes");

	}

	else if (a==c && a!=b && b!=c){

		printf("Yes");

	}

	else if (a==b && a==c && b==c){

		printf("No");

	}

	else if(a!=b && a!=c && b!=c){

		printf("No");

	}

	

	return 0;

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

using namespace std;

typedef long long ll;

typedef vector<int> vi;

typedef pair<int, int> ii;

typedef vector<ii> vii;



int main()

{

    int a, b, c; cin >> a >> b >> c;

    if ((a == b || b == c || c == a) && !(a == b && b == c))

        cout << "Yes" << '\n';

    else

        cout << "No" << '\n';

    return 0;

}


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



int main() {

    int A, B, C;

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

    if (A == B && B != C){

    	printf("Yes");

	}

    else if (A == C && C != B){

    	printf("Yes");

	}

    else if (B == C && C != A){

    	printf("Yes");

	}

    else{

    	printf("No");

	}

    return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main(){

	int a,b,c;

	cin>>a>>b>>c;

	if(a==b&&a!=c||a==c&&b!=a||b==c&&b!=a) puts("Yes");

	else puts("No");

}


// Faster C++ solution for the same problem (measured speedup: 5.255255628725699x):
//varun

#include <stdio.h>



 int main(void){

 int a, b, c;



 scanf("%d%d%d", &a, &b, &c);



 int ispoor = 0;

 if (a == b && b != c) ispoor = 1;

 if (b == c && c != a) ispoor = 1;

 if (c == a && a != b) ispoor = 1;



 if (ispoor) {

 puts("Yes");

 } else {

 puts("No");

 }



 return 0;

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

using namespace std;



int main()

{

	int a;

	int b;

	int c;

	cin >> a >> b >> c;

	if (a == b && a != c)

	{

		cout << "Yes";

	}

	else if (a == c && a != b)

	{

		cout << "Yes";

	}

	else if (b == c && a != b)

	{

		cout << "Yes";

	}

	else {

		cout << "No";

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.311463742627487x):
//varun

#include <stdio.h>



 int main(void){

 int a, b, c;



 scanf("%d%d%d", &a, &b, &c);



 int ispoor = 0;

 if (a == b && b != c) ispoor = 1;

 if (b == c && c != a) ispoor = 1;

 if (c == a && a != b) ispoor = 1;



 if (ispoor) {

 puts("Yes");

 } else {

 puts("No");

 }



 return 0;

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

using namespace std;

int main()

{

	int d,e,f;

	cin>>d>>e>>f;

	  if(d==e && e==f)

	    cout<<"No";

    else if(d==e || e == f || d==f)

	 {

	 	cout<<"Yes";

	 	

	 }



     else

         cout<<"No";

}

// Faster C++ solution for the same problem (measured speedup: 5.311537636280866x):
//varun

#include <stdio.h>



 int main(void){

 int a, b, c;



 scanf("%d%d%d", &a, &b, &c);



 int ispoor = 0;

 if (a == b && b != c) ispoor = 1;

 if (b == c && c != a) ispoor = 1;

 if (c == a && a != b) ispoor = 1;



 if (ispoor) {

 puts("Yes");

 } else {

 puts("No");

 }



 return 0;

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

using namespace std;

int main()

{

int A, B, C;

cin>>A>>B>>C;

if((A==B && B != C) || (A==C && A != B) ||(B==C && B != A) ) 

    cout<<"Yes";

else 

   cout<<"No";

return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.311542785314554x):
//varun

#include <stdio.h>



 int main(void){

 int a, b, c;



 scanf("%d%d%d", &a, &b, &c);



 int ispoor = 0;

 if (a == b && b != c) ispoor = 1;

 if (b == c && c != a) ispoor = 1;

 if (c == a && a != b) ispoor = 1;



 if (ispoor) {

 puts("Yes");

 } else {

 puts("No");

 }



 return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main(){

	int a,b,c;

	cin>>a>>b>>c;

	if(a==b&&a!=c||a==c&&b!=a||b==c&&b!=a) puts("Yes");

	else puts("No");

}


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

int main()

{

	int a,b,c;

	scanf("%d %d %d",&a,&b,&c);

	if(a==b&&a!=c&&b!=c){

		printf("Yes");

	}

	else if(a==c&&a!=b&&c!=b)

	    printf("Yes");

	else if(b==c&&b!=a&&c!=a)

	    printf("Yes");

	else if(a==b&&a==c&&b==c)

	    printf("No");

	else if(a!=b&&a!=c&&b!=c)

	    printf("No");

	    

	return 0;

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

using namespace std;



int main()

{

	int a;

	int b;

	int c;

	cin >> a >> b >> c;

	if (a == b && a != c)

	{

		cout << "Yes";

	}

	else if (a == c && a != b)

	{

		cout << "Yes";

	}

	else if (b == c && a != b)

	{

		cout << "Yes";

	}

	else {

		cout << "No";

	}

	return 0;

}

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

int main()

{

	int a,b,c;

	scanf("%d %d %d",&a,&b,&c);

	if(a==b&&a!=c&&b!=c){

		printf("Yes");

	}

	else if(a==c&&a!=b&&c!=b)

	    printf("Yes");

	else if(b==c&&b!=a&&c!=a)

	    printf("Yes");

	else if(a==b&&a==c&&b==c)

	    printf("No");

	else if(a!=b&&a!=c&&b!=c)

	    printf("No");

	    

	return 0;

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

using namespace std;

int main()

{

	int d,e,f;

	cin>>d>>e>>f;

	  if(d==e && e==f)

	    cout<<"No";

    else if(d==e || e == f || d==f)

	 {

	 	cout<<"Yes";

	 	

	 }



     else

         cout<<"No";

}

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

int main()

{

	int a,b,c;

	scanf("%d %d %d",&a,&b,&c);

	if(a==b&&a!=c&&b!=c){

		printf("Yes");

	}

	else if(a==c&&a!=b&&c!=b)

	    printf("Yes");

	else if(b==c&&b!=a&&c!=a)

	    printf("Yes");

	else if(a==b&&a==c&&b==c)

	    printf("No");

	else if(a!=b&&a!=c&&b!=c)

	    printf("No");

	    

	return 0;

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

using namespace std;

int main()

{

int A, B, C;

cin>>A>>B>>C;

if((A==B && B != C) || (A==C && A != B) ||(B==C && B != A) ) 

    cout<<"Yes";

else 

   cout<<"No";

return 0;

}

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

int main()

{

	int a,b,c;

	scanf("%d %d %d",&a,&b,&c);

	if(a==b&&a!=c&&b!=c){

		printf("Yes");

	}

	else if(a==c&&a!=b&&c!=b)

	    printf("Yes");

	else if(b==c&&b!=a&&c!=a)

	    printf("Yes");

	else if(a==b&&a==c&&b==c)

	    printf("No");

	else if(a!=b&&a!=c&&b!=c)

	    printf("No");

	    

	return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main(){

	int a,b,c;

	cin>>a>>b>>c;

	if(a==b&&a!=c||a==c&&b!=a||b==c&&b!=a) puts("Yes");

	else puts("No");

}


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



int main (){

	

	int a,b,c;

	scanf ("%d %d %d", &a, &b, &c);

	if ( a == b && b == c || a!= b && b != c && a != c){

		printf ("No\n");

	}

	else if (a == b != c|| a != b == c || a == c != b){

		printf ("Yes\n");

	} 

	

	return 0;

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

using namespace std;



int main()

{

	int a;

	int b;

	int c;

	cin >> a >> b >> c;

	if (a == b && a != c)

	{

		cout << "Yes";

	}

	else if (a == c && a != b)

	{

		cout << "Yes";

	}

	else if (b == c && a != b)

	{

		cout << "Yes";

	}

	else {

		cout << "No";

	}

	return 0;

}

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



int main (){

	

	int a,b,c;

	scanf ("%d %d %d", &a, &b, &c);

	if ( a == b && b == c || a!= b && b != c && a != c){

		printf ("No\n");

	}

	else if (a == b != c|| a != b == c || a == c != b){

		printf ("Yes\n");

	} 

	

	return 0;

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

using namespace std;

int main()

{

	int d,e,f;

	cin>>d>>e>>f;

	  if(d==e && e==f)

	    cout<<"No";

    else if(d==e || e == f || d==f)

	 {

	 	cout<<"Yes";

	 	

	 }



     else

         cout<<"No";

}

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



int main (){

	

	int a,b,c;

	scanf ("%d %d %d", &a, &b, &c);

	if ( a == b && b == c || a!= b && b != c && a != c){

		printf ("No\n");

	}

	else if (a == b != c|| a != b == c || a == c != b){

		printf ("Yes\n");

	} 

	

	return 0;

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

using namespace std;

int main()

{

int A, B, C;

cin>>A>>B>>C;

if((A==B && B != C) || (A==C && A != B) ||(B==C && B != A) ) 

    cout<<"Yes";

else 

   cout<<"No";

return 0;

}

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



int main (){

	

	int a,b,c;

	scanf ("%d %d %d", &a, &b, &c);

	if ( a == b && b == c || a!= b && b != c && a != c){

		printf ("No\n");

	}

	else if (a == b != c|| a != b == c || a == c != b){

		printf ("Yes\n");

	} 

	

	return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main(){

	int a,b,c;

	cin>>a>>b>>c;

	if(a==b&&a!=c||a==c&&b!=a||b==c&&b!=a) puts("Yes");

	else puts("No");

}


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



int main ()

{

	int A, B, C;

	

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

	

	if (A==B && A!=C && B!=C){

		printf("Yes");

	} else if (A==C && A!=B && B!=C){

		printf("Yes");

	}else if (B==C && A!=B && A!=C){

		printf("Yes");

	}else if (A==B && A==C && B==C){

		printf("No");

	}else if (A!=B && A!=C && B!=C){

		printf("No");

	}

		

	return 0;

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

using namespace std;



int main()

{

	int a;

	int b;

	int c;

	cin >> a >> b >> c;

	if (a == b && a != c)

	{

		cout << "Yes";

	}

	else if (a == c && a != b)

	{

		cout << "Yes";

	}

	else if (b == c && a != b)

	{

		cout << "Yes";

	}

	else {

		cout << "No";

	}

	return 0;

}

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



int main ()

{

	int A, B, C;

	

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

	

	if (A==B && A!=C && B!=C){

		printf("Yes");

	} else if (A==C && A!=B && B!=C){

		printf("Yes");

	}else if (B==C && A!=B && A!=C){

		printf("Yes");

	}else if (A==B && A==C && B==C){

		printf("No");

	}else if (A!=B && A!=C && B!=C){

		printf("No");

	}

		

	return 0;

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

using namespace std;

int main()

{

	int d,e,f;

	cin>>d>>e>>f;

	  if(d==e && e==f)

	    cout<<"No";

    else if(d==e || e == f || d==f)

	 {

	 	cout<<"Yes";

	 	

	 }



     else

         cout<<"No";

}

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



int main ()

{

	int A, B, C;

	

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

	

	if (A==B && A!=C && B!=C){

		printf("Yes");

	} else if (A==C && A!=B && B!=C){

		printf("Yes");

	}else if (B==C && A!=B && A!=C){

		printf("Yes");

	}else if (A==B && A==C && B==C){

		printf("No");

	}else if (A!=B && A!=C && B!=C){

		printf("No");

	}

		

	return 0;

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

using namespace std;

int main()

{

int A, B, C;

cin>>A>>B>>C;

if((A==B && B != C) || (A==C && A != B) ||(B==C && B != A) ) 

    cout<<"Yes";

else 

   cout<<"No";

return 0;

}

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



int main ()

{

	int A, B, C;

	

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

	

	if (A==B && A!=C && B!=C){

		printf("Yes");

	} else if (A==C && A!=B && B!=C){

		printf("Yes");

	}else if (B==C && A!=B && A!=C){

		printf("Yes");

	}else if (A==B && A==C && B==C){

		printf("No");

	}else if (A!=B && A!=C && B!=C){

		printf("No");

	}

		

	return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main(){

	int a,b,c;

	cin>>a>>b>>c;

	if(a==b&&a!=c||a==c&&b!=a||b==c&&b!=a) puts("Yes");

	else puts("No");

}


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

int main(){

int A;

int B;

int C;	

	

scanf("%d",&A);

scanf("%d",&B);

scanf("%d",&C);	



	if(A==C&&A!=B&&B!=C){

	printf("Yes\n");

	}

	else if(A==B&&A!=C&&B!=C){

		printf("Yes\n");

	}

	else if(B==C&&B!=A&&A!=C){

		printf("Yes\n");

	}

	else if(A==B&&A==C&B==C){

		printf("No\n");

	}

	else if(A!=B&&A!=C&B!=C){

		printf("No\n");

	}

	return 0;

}