#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
static const double pi = 3.141592653589793;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
const ll imod = 998244353;
using mint = modint998244353;
vector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
ll P(ll x, ll n) {
  ll ret = 1;
    while (n > 0) {
      if (n & 1) ret *= x;
      x *= x;
      n >>= 1;
  }
  return ret;
}

void seek(bool f){
  cout << (f ? "Yes" : "No") << endl;
}

int main(){
	int N;
	cin >> N;
	vector<string> S(N), T(N);
	rep(i, N){
		cin >> S[i] >> T[i];
	}
	for(int i = 0; i < N; i++){
		bool fs = true, ft = true;
		for(int j = 0; j < N; j++){
			if(i == j){
				continue;
			}
			if(S[i] == S[j] or S[i] == T[j]){
				fs = false;
			}
			if(T[i] == S[j] or T[i] == T[j]){
				ft = false;
			}
		}
		if(!fs and !ft){
			cout << "No" << endl;
			return 0;
		}
	}
	cout << "Yes" << endl;
}