import java.util.*;

public class Main{

    static int mod = (int) 1e9 + 7;
    static int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
    static int INF = Integer.MAX_VALUE/2;

    public static void main(String args[]){

        Scanner scan = new Scanner(System.in);

        //Queue<int[]> q = new ArrayDeque<int[]>();
        int a = scan.nextInt();
        int b = scan.nextInt();
        int c = scan.nextInt();

        if(((a==b)&&(b!=c)) || ((b==c)&&(c!=a)) || ((c==a)&&(a!=b)))   
            System.out.println("Yes");
        else
            System.out.println("No");
    }

    static int factorial(int n){
        if(n == 0){
          return 1;
        }
        return n * factorial(n-1);
    }


} import java.util.*; util.* java public class Main{

    static int mod = (int) 1e9 + 7;
    static int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
    static int INF = Integer.MAX_VALUE/2;

    public static void main(String args[]){

        Scanner scan = new Scanner(System.in);

        //Queue<int[]> q = new ArrayDeque<int[]>();
        int a = scan.nextInt();
        int b = scan.nextInt();
        int c = scan.nextInt();

        if(((a==b)&&(b!=c)) || ((b==c)&&(c!=a)) || ((c==a)&&(a!=b)))   
            System.out.println("Yes");
        else
            System.out.println("No");
    }

    static int factorial(int n){
        if(n == 0){
          return 1;
        }
        return n * factorial(n-1);
    }


} Main static int mod = (int) 1e9 + 7; mod (int) 1e9 + 7 (int) 1e9 7 static int dx[] = {-1, 0, 1, 0} dx {-1, 0, 1, 0} -1 1 0 1 0 dy[] = {0, -1, 0, 1}; dy {0, -1, 0, 1} 0 -1 1 0 1 static int INF = Integer.MAX_VALUE/2; INF Integer.MAX_VALUE/2 Integer.MAX_VALUE Integer Integer.MAX_VALUE 2 public static void main(String args[]){

        Scanner scan = new Scanner(System.in);

        //Queue<int[]> q = new ArrayDeque<int[]>();
        int a = scan.nextInt();
        int b = scan.nextInt();
        int c = scan.nextInt();

        if(((a==b)&&(b!=c)) || ((b==c)&&(c!=a)) || ((c==a)&&(a!=b)))   
            System.out.println("Yes");
        else
            System.out.println("No");
    } main {

        Scanner scan = new Scanner(System.in);

        //Queue<int[]> q = new ArrayDeque<int[]>();
        int a = scan.nextInt();
        int b = scan.nextInt();
        int c = scan.nextInt();

        if(((a==b)&&(b!=c)) || ((b==c)&&(c!=a)) || ((c==a)&&(a!=b)))   
            System.out.println("Yes");
        else
            System.out.println("No");
    } Scanner scan = new Scanner(System.in); scan new Scanner(System.in) int a = scan.nextInt(); a scan.nextInt() scan.nextInt scan int b = scan.nextInt(); b scan.nextInt() scan.nextInt scan int c = scan.nextInt(); c scan.nextInt() scan.nextInt scan if(((a==b)&&(b!=c)) || ((b==c)&&(c!=a)) || ((c==a)&&(a!=b)))   
            System.out.println("Yes");
        else
            System.out.println("No"); ((a==b)&&(b!=c)) || ((b==c)&&(c!=a)) || ((c==a)&&(a!=b)) ((a==b)&&(b!=c)) || ((b==c)&&(c!=a)) || ((c==a)&&(a!=b)) ((a==b)&&(b!=c)) (a==b) a b (b!=c) b c ((b==c)&&(c!=a)) (b==c) b c (c!=a) c a ((c==a)&&(a!=b)) (c==a) c a (a!=b) a b System.out.println("Yes") System.out.println System.out System System.out "Yes" System.out.println("No") System.out.println System.out System System.out "No" String args[] args static int factorial(int n){
        if(n == 0){
          return 1;
        }
        return n * factorial(n-1);
    } factorial {
        if(n == 0){
          return 1;
        }
        return n * factorial(n-1);
    } if(n == 0){
          return 1;
        } n == 0 n 0 {
          return 1;
        } return 1; 1 return n * factorial(n-1); n * factorial(n-1) n factorial(n-1) factorial n-1 n 1 int n n public class Main{

    static int mod = (int) 1e9 + 7;
    static int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
    static int INF = Integer.MAX_VALUE/2;

    public static void main(String args[]){

        Scanner scan = new Scanner(System.in);

        //Queue<int[]> q = new ArrayDeque<int[]>();
        int a = scan.nextInt();
        int b = scan.nextInt();
        int c = scan.nextInt();

        if(((a==b)&&(b!=c)) || ((b==c)&&(c!=a)) || ((c==a)&&(a!=b)))   
            System.out.println("Yes");
        else
            System.out.println("No");
    }

    static int factorial(int n){
        if(n == 0){
          return 1;
        }
        return n * factorial(n-1);
    }


} public class Main{

    static int mod = (int) 1e9 + 7;
    static int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
    static int INF = Integer.MAX_VALUE/2;

    public static void main(String args[]){

        Scanner scan = new Scanner(System.in);

        //Queue<int[]> q = new ArrayDeque<int[]>();
        int a = scan.nextInt();
        int b = scan.nextInt();
        int c = scan.nextInt();

        if(((a==b)&&(b!=c)) || ((b==c)&&(c!=a)) || ((c==a)&&(a!=b)))   
            System.out.println("Yes");
        else
            System.out.println("No");
    }

    static int factorial(int n){
        if(n == 0){
          return 1;
        }
        return n * factorial(n-1);
    }


} Main
import java.util.*;

public class Main{

    static int mod = (int) 1e9 + 7;
    static int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
    static int INF = Integer.MAX_VALUE/2;

    public static void main(String args[]){

        Scanner scan = new Scanner(System.in);

        //Queue<int[]> q = new ArrayDeque<int[]>();
        int a = scan.nextInt();
        int b = scan.nextInt();
        int c = scan.nextInt();

        if(((a==b)&&(b!=c)) || ((b==c)&&(c!=a)) || ((c==a)&&(a!=b)))   
            System.out.println("Yes");
        else
            System.out.println("No");
    }

    static int factorial(int n){
        if(n == 0){
          return 1;
        }
        return n * factorial(n-1);
    }


}