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

 

using namespace std;

 

int main()

{

    int a,b,c;

    cin>>a>>b>>c;

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

    cout<<"No";

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

    cout<<"Yes";

    else 

    cout<<"No";

    return 0;

}

// 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){

	printf ("Yes");

}

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

	printf("Yes");

}

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

	printf("Yes");

}

else {

	printf("No");

}

	return 0;

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

#include <algorithm>

using namespace std;



int arr[3];

int main(){

    for(int i = 0;i<3;i++) scanf("%d",&arr[i]);

    sort(arr,arr+3);

    if(arr[0] == arr[1] && arr[1] != arr[2]){

        puts("Yes");

    }else if(arr[0] != arr[1] && arr[1] == arr[2]){

        puts("Yes");

    }else{

        puts("No");

    }





    return 0;

}

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



int main(){

	int A, B, C;

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

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

		printf("No");

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

		printf("Yes");

	}else{

		printf("No");

	}

	return 0;

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

using namespace std;

int main()

{

int a1,b1,c1;

cin>>a1>>b1>>c1;

if(a1==b1 && a1!=c1)

{

cout<<"Yes";

}

else if(b1==c1 && c1!=a1)

{

 cout<<"Yes";

}

else if(a1==c1 && a1!=b1)

{

 cout<<"Yes";

}

else

{

 cout<<"No";

}

return 0;

}

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



int main(){

	int A, B, C;

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

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

		printf("No");

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

		printf("Yes");

	}else{

		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)

    cout<<"No";

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

    cout<<"Yes";

    else 

    cout<<"No";

    return 0;

}

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



int main(){

	int A, B, C;

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

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

		printf("No");

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

		printf("Yes");

	}else{

		printf("No");

	}

	return 0;

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

#include <algorithm>

using namespace std;



int arr[3];

int main(){

    for(int i = 0;i<3;i++) scanf("%d",&arr[i]);

    sort(arr,arr+3);

    if(arr[0] == arr[1] && arr[1] != arr[2]){

        puts("Yes");

    }else if(arr[0] != arr[1] && arr[1] == arr[2]){

        puts("Yes");

    }else{

        puts("No");

    }





    return 0;

}

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



int main()

{

    int A,B,C;

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

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

    {

        printf("Yes");

    }

    else {

        printf("No");

    }

    return 0;

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

using namespace std;

int main()

{

int a1,b1,c1;

cin>>a1>>b1>>c1;

if(a1==b1 && a1!=c1)

{

cout<<"Yes";

}

else if(b1==c1 && c1!=a1)

{

 cout<<"Yes";

}

else if(a1==c1 && a1!=b1)

{

 cout<<"Yes";

}

else

{

 cout<<"No";

}

return 0;

}

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



int main()

{

    int A,B,C;

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

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

    {

        printf("Yes");

    }

    else {

        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)

    cout<<"No";

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

    cout<<"Yes";

    else 

    cout<<"No";

    return 0;

}

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



int main()

{

    int A,B,C;

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

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

    {

        printf("Yes");

    }

    else {

        printf("No");

    }

    return 0;

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

#include <algorithm>

using namespace std;



int arr[3];

int main(){

    for(int i = 0;i<3;i++) scanf("%d",&arr[i]);

    sort(arr,arr+3);

    if(arr[0] == arr[1] && arr[1] != arr[2]){

        puts("Yes");

    }else if(arr[0] != arr[1] && arr[1] == arr[2]){

        puts("Yes");

    }else{

        puts("No");

    }





    return 0;

}

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

int main(){

	int numA, numB, numC;

	scanf("%d %d %d", &numA, &numB, &numC);

		if(numA == numB && numB == numC && numA == numC){printf("No");}

		else if(numA != numB && numB != numC && numA != numC){printf("No");}

		else if(numA == numB && numB != numC){printf("Yes");}

		else if(numB == numC && numB != numA){printf("Yes");}

		else if(numA == numC && numA != numB){printf("Yes");}

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

using namespace std;

int main()

{

int a1,b1,c1;

cin>>a1>>b1>>c1;

if(a1==b1 && a1!=c1)

{

cout<<"Yes";

}

else if(b1==c1 && c1!=a1)

{

 cout<<"Yes";

}

else if(a1==c1 && a1!=b1)

{

 cout<<"Yes";

}

else

{

 cout<<"No";

}

return 0;

}

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

int main(){

	int numA, numB, numC;

	scanf("%d %d %d", &numA, &numB, &numC);

		if(numA == numB && numB == numC && numA == numC){printf("No");}

		else if(numA != numB && numB != numC && numA != numC){printf("No");}

		else if(numA == numB && numB != numC){printf("Yes");}

		else if(numB == numC && numB != numA){printf("Yes");}

		else if(numA == numC && numA != numB){printf("Yes");}

	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)

    cout<<"No";

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

    cout<<"Yes";

    else 

    cout<<"No";

    return 0;

}

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

int main(){

	int numA, numB, numC;

	scanf("%d %d %d", &numA, &numB, &numC);

		if(numA == numB && numB == numC && numA == numC){printf("No");}

		else if(numA != numB && numB != numC && numA != numC){printf("No");}

		else if(numA == numB && numB != numC){printf("Yes");}

		else if(numB == numC && numB != numA){printf("Yes");}

		else if(numA == numC && numA != numB){printf("Yes");}

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

#include <vector>

#include <algorithm>

#include <numeric>

#include <functional>

#include <queue>

#include <stack>

#include <bitset>

#include <set>

#include <chrono>

#include <string>

#include <assert.h>



using namespace std;



#define endl '\n'



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0);



    int a, b, c;

    cin >> a >> b >> c;



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

        cout << "Yes" << endl;

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

        cout << "Yes" << endl;

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

        cout << "Yes" << endl;

    else

        cout << "No" << endl;



    return 0;

}

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

#include <string.h>



int main()

{

    int A, B, C;

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



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

    {

        printf("No");

    }

    else if ((A == B || A == C || B == C))

    {

        printf("Yes");

    } else

    {

        printf("No");

    }

    



    



    return 0;

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

using namespace std;

int main() {

    int A, B, C;

    while (cin >> A >> B >> C) {

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

            cout << "Yes" << endl;

        else

            cout << "No" << endl;

    }



    return 0;

}

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

#include <string.h>



int main()

{

    int A, B, C;

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



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

    {

        printf("No");

    }

    else if ((A == B || A == C || B == C))

    {

        printf("Yes");

    } else

    {

        printf("No");

    }

    



    



    return 0;

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

using namespace std;

int main(){

    int a,b,c;

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

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

    else printf("No");

    return 0;

}

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

#include <string.h>



int main()

{

    int A, B, C;

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



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

    {

        printf("No");

    }

    else if ((A == B || A == C || B == C))

    {

        printf("Yes");

    } else

    {

        printf("No");

    }

    



    



    return 0;

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

#include<string>

using namespace std;



int main(){

    int A, B, C;

    while(cin>>A>>B>>C){

        int t = 0;

        if(A==B)

            t++;

        if(A==C)

            t++;

        if(B==C)

            t++;

        if(t==1)

            cout << "Yes" << endl;

        else

            cout << "No" << endl;

    }

    return 0;

}




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

#include <string.h>



int main()

{

    int A, B, C;

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



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

    {

        printf("No");

    }

    else if ((A == B || A == C || B == C))

    {

        printf("Yes");

    } else

    {

        printf("No");

    }

    



    



    return 0;

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

#include <vector>

#include <algorithm>

#include <numeric>

#include <functional>

#include <queue>

#include <stack>

#include <bitset>

#include <set>

#include <chrono>

#include <string>

#include <assert.h>



using namespace std;



#define endl '\n'



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0);



    int a, b, c;

    cin >> a >> b >> c;



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

        cout << "Yes" << endl;

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

        cout << "Yes" << endl;

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

        cout << "Yes" << endl;

    else

        cout << "No" << endl;



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3705000705409445x):
#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(c==b && a!=c && b!=a){

		printf("Yes\n");

	}

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

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main() {

    int A, B, C;

    while (cin >> A >> B >> C) {

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

            cout << "Yes" << endl;

        else

            cout << "No" << endl;

    }



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.315378980452897x):
#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(c==b && a!=c && b!=a){

		printf("Yes\n");

	}

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

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main(){

    int a,b,c;

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

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

    else printf("No");

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.243956242376996x):
#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(c==b && a!=c && b!=a){

		printf("Yes\n");

	}

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

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

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

#include<string>

using namespace std;



int main(){

    int A, B, C;

    while(cin>>A>>B>>C){

        int t = 0;

        if(A==B)

            t++;

        if(A==C)

            t++;

        if(B==C)

            t++;

        if(t==1)

            cout << "Yes" << endl;

        else

            cout << "No" << endl;

    }

    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.315378980452897x):
#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(c==b && a!=c && b!=a){

		printf("Yes\n");

	}

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

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

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

#include <vector>

#include <algorithm>

#include <numeric>

#include <functional>

#include <queue>

#include <stack>

#include <bitset>

#include <set>

#include <chrono>

#include <string>

#include <assert.h>



using namespace std;



#define endl '\n'



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0);



    int a, b, c;

    cin >> a >> b >> c;



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

        cout << "Yes" << endl;

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

        cout << "Yes" << endl;

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

        cout << "Yes" << endl;

    else

        cout << "No" << endl;



    return 0;

}

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

int main(){

  int A,B,C;

  scanf("%d",&A);

  scanf("%d",&B);

  scanf("%d",&C);

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

    printf("Yes");

  }

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

   printf("Yes");

  }

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

    printf("Yes");

  }

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

    printf("No");

  }

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

    printf("No");

  }

  return 0;

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

using namespace std;

int main() {

    int A, B, C;

    while (cin >> A >> B >> C) {

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

            cout << "Yes" << endl;

        else

            cout << "No" << endl;

    }



    return 0;

}

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

int main(){

  int A,B,C;

  scanf("%d",&A);

  scanf("%d",&B);

  scanf("%d",&C);

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

    printf("Yes");

  }

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

   printf("Yes");

  }

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

    printf("Yes");

  }

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

    printf("No");

  }

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

    printf("No");

  }

  return 0;

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

using namespace std;

int main(){

    int a,b,c;

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

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

    else printf("No");

    return 0;

}

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

int main(){

  int A,B,C;

  scanf("%d",&A);

  scanf("%d",&B);

  scanf("%d",&C);

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

    printf("Yes");

  }

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

   printf("Yes");

  }

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

    printf("Yes");

  }

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

    printf("No");

  }

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

    printf("No");

  }

  return 0;

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

#include<string>

using namespace std;



int main(){

    int A, B, C;

    while(cin>>A>>B>>C){

        int t = 0;

        if(A==B)

            t++;

        if(A==C)

            t++;

        if(B==C)

            t++;

        if(t==1)

            cout << "Yes" << endl;

        else

            cout << "No" << endl;

    }

    return 0;

}




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

int main(){

  int A,B,C;

  scanf("%d",&A);

  scanf("%d",&B);

  scanf("%d",&C);

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

    printf("Yes");

  }

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

   printf("Yes");

  }

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

    printf("Yes");

  }

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

    printf("No");

  }

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

    printf("No");

  }

  return 0;

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

#include <vector>

#include <algorithm>

#include <numeric>

#include <functional>

#include <queue>

#include <stack>

#include <bitset>

#include <set>

#include <chrono>

#include <string>

#include <assert.h>



using namespace std;



#define endl '\n'



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0);



    int a, b, c;

    cin >> a >> b >> c;



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

        cout << "Yes" << endl;

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

        cout << "Yes" << endl;

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

        cout << "Yes" << endl;

    else

        cout << "No" << endl;



    return 0;

}

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



int main ()

{

	int A,B,C;

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

	

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

		printf("No");

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

		printf("Yes");

	}else{

		printf("No");

	}

	

	return 0;

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

using namespace std;

int main() {

    int A, B, C;

    while (cin >> A >> B >> C) {

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

            cout << "Yes" << endl;

        else

            cout << "No" << endl;

    }



    return 0;

}

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



int main ()

{

	int A,B,C;

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

	

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

		printf("No");

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

		printf("Yes");

	}else{

		printf("No");

	}

	

	return 0;

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

using namespace std;

int main(){

    int a,b,c;

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

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

    else printf("No");

    return 0;

}

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



int main ()

{

	int A,B,C;

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

	

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

		printf("No");

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

		printf("Yes");

	}else{

		printf("No");

	}

	

	return 0;

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

#include<string>

using namespace std;



int main(){

    int A, B, C;

    while(cin>>A>>B>>C){

        int t = 0;

        if(A==B)

            t++;

        if(A==C)

            t++;

        if(B==C)

            t++;

        if(t==1)

            cout << "Yes" << endl;

        else

            cout << "No" << endl;

    }

    return 0;

}




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



int main ()

{

	int A,B,C;

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

	

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

		printf("No");

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

		printf("Yes");

	}else{

		printf("No");

	}

	

	return 0;

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

#include <vector>

#include <algorithm>

#include <numeric>

#include <functional>

#include <queue>

#include <stack>

#include <bitset>

#include <set>

#include <chrono>

#include <string>

#include <assert.h>



using namespace std;



#define endl '\n'



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0);



    int a, b, c;

    cin >> a >> b >> c;



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

        cout << "Yes" << endl;

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

        cout << "Yes" << endl;

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

        cout << "Yes" << endl;

    else

        cout << "No" << endl;



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.382792201924735x):
#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;

    while (cin >> A >> B >> C) {

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

            cout << "Yes" << endl;

        else

            cout << "No" << endl;

    }



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3275449493429745x):
#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;

int main(){

    int a,b,c;

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

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

    else printf("No");

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.255958737164348x):
#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>

#include<string>

using namespace std;



int main(){

    int A, B, C;

    while(cin>>A>>B>>C){

        int t = 0;

        if(A==B)

            t++;

        if(A==C)

            t++;

        if(B==C)

            t++;

        if(t==1)

            cout << "Yes" << endl;

        else

            cout << "No" << endl;

    }

    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.3275449493429745x):
#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>

#include <vector>

#include <algorithm>

#include <numeric>

#include <functional>

#include <queue>

#include <stack>

#include <bitset>

#include <set>

#include <chrono>

#include <string>

#include <assert.h>



using namespace std;



#define endl '\n'



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0);



    int a, b, c;

    cin >> a >> b >> c;



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

        cout << "Yes" << endl;

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

        cout << "Yes" << endl;

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

        cout << "Yes" << endl;

    else

        cout << "No" << endl;



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.369702161706129x):
#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");

	}

	else if(A==B || B==C || C==A)

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;

}