#include <bits/stdc++.h>
#include <iostream>
#define ll long long int
#define ld long double
using namespace std;
ll TOP_POINT=-1;
ll SQUARE_POINT[100000];

ll PRIME_POINT[100002];
ll minn=1,maxx=0,nn=0;

void FIND_MINIMUM_NUMBER(ll n) 
{ 
	ll COUNTER_POINT = 0, ANSWER = 1; 
	while (n%2 == 0) 
	{ 
		COUNTER_POINT++; 
		n /= 2; 
	}  
	if (COUNTER_POINT%2) 
		ANSWER *= 2; 

	for (ll i = 3; i <= sqrt(n); i += 2) 
	{ 
		COUNTER_POINT = 0; 
		while (n%i == 0) 
		{ 
			COUNTER_POINT++; 
			n /= i; 
		} 
		if (COUNTER_POINT%2) 
			ANSWER *= i; 
	} 

	if (n > 2) 
		ANSWER *= n; 

	minn=ANSWER;
} 


void INSERT_MULTI_POINT(ll n,vector<ll> &s)
{
    
    ll nu=n*minn;
    for(ll i=1;i<=n;i++)
    {
        ll num = nu*(i*i);
        ld rt= sqrt(num);
        if(rt>n)
            break;
        if((rt*rt)==num)
        {
            s.push_back(minn*(i*i));
        }
    }
}
bool COMPARE_POINT(ll a,ll b)
{
    ll num1=abs(a);
    ll num2=abs(b);
    return num1>num2;
}
vector<ll> mult[100001];
void solve()
{
		ll m,n;
        cin>>n>>m;
        ll x[n],y[m];
        set<ll> xset;
        set<ll> xxset;
        set<ll> yset;
        set<ll> yyset;
        
        ll COUNTER_POINT=0;
        
        for(ll i=0;i<n;i++)
        {
            cin>>x[i];
            if(x[i]!=0)
            {
            	xset.insert(x[i]);
            	xxset.insert(x[i]);
            }
            
        }
        
        for(ll i=0;i<m;i++)
        {
            cin>>y[i];
            if(y[i]!=0)
            {
                yset.insert(y[i]);
            	yyset.insert(y[i]);
            }
            
        }
        
        sort(x,x+n,COMPARE_POINT);
        sort(y,y+m,COMPARE_POINT);
        
        for(ll i=0;i<n;i++)
        {
            ll num1=abs(x[i]);
            if(num1==0)
            {
                COUNTER_POINT=COUNTER_POINT+(m*(n-1));
               
                continue;
            }
            
            vector<ll> se = mult[num1];
            
            for(auto a =se.begin();a!=se.end();a++ )
            {
                ll num2=(*a);
                ll root = sqrt(num1*num2);
                if(num1==num2)
                {
                    if(xxset.find(num1)!=xxset.end() && xxset.find(-1*num2)!=xxset.end())
                    {
                        if(yset.find(root)!=yset.end())
                            COUNTER_POINT++;
                        if(yset.find(-1*root)!=yset.end())
                            COUNTER_POINT++;
                    }
                }
                else 
                {
                    
                    if(xxset.find(num1)!=xxset.end() && xxset.find(-1*num2)!=xxset.end())
                    {
                        if(yset.find(root)!=yset.end())
                            COUNTER_POINT++;
                        if(yset.find(-1*root)!=yset.end())
                            COUNTER_POINT++;
                    }
                    else if(xxset.find(-1*num1)!=xxset.end() && xxset.find(num2)!=xxset.end())
                    {
                        if(yset.find(root)!=yset.end())
                            COUNTER_POINT++;
                        if(yset.find(-1*root)!=yset.end())
                            COUNTER_POINT++;
                    }
                }
                
            }
            xxset.erase(x[i]);
        }
        
        for(ll i=0;i<=m;i++)
        {
            ll num1=abs(y[i]);
            if(num1==0)
            {
                COUNTER_POINT=COUNTER_POINT+(n*(m-1));
                continue;
            }
            
            vector<ll> se = mult[num1];
            
            for(auto a =se.begin();a!=se.end();a++ )
            {
                ll num2=(*a);
                ll root = sqrt(num1*num2);
                if(num1==num2)
                {
                    if(yyset.find(num1)!=yyset.end() && yyset.find(-1*num2)!=yyset.end())
                    {
                        if(xset.find(root)!=xset.end())
                            COUNTER_POINT++;
                        if(xset.find(-1*root)!=xset.end())
                            COUNTER_POINT++;
                    }
                }
                else 
                {
                    if(yyset.find(num1)!=yyset.end() && yyset.find(-1*num2)!=yyset.end())
                    {
                        if(xset.find(root)!=xset.end())
                            COUNTER_POINT++;
                        if(xset.find(-1*root)!=xset.end())
                            COUNTER_POINT++;
                    }
                    else if(yyset.find(-1*num1)!=yyset.end() && yyset.find(num2)!=yyset.end())
                    {
                        if(xset.find(root)!=xset.end())
                            COUNTER_POINT++;
                        if(xset.find(-1*root)!=xset.end())
                            COUNTER_POINT++;
                    }
                }
                
            }
            yyset.erase(y[i]);
        }
        
        cout<<COUNTER_POINT<<endl;
		}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int a,b,c;
    cin>>a>>b>>c;
    int A[3];
    	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;
}	

Measured memory_bytes: 2560