sicily 1021

#include "iostream"
#include "stack"
#include "map"
using namespace std;

int main()
{
	int N;
	while (cin >> N && N != 0)
	{
		map<int, int> m;
		stack<int> s;
		int pos1, pos2;
		for (int i = 0; i < N; i++)
		{
			cin >> pos1 >> pos2;
			m[pos1] = pos2;
			m[pos2] = pos1;
		}
		for (int i = 1; i <= N * 2; i++)
		{
			if (!s.empty() && m[i] == s.top())
				s.pop();
			else if (!s.empty() && m[i] != s.top())
				s.push(i);
			else 
				s.push(i);
		}
		if (s.empty())
			cout << "Yes" << endl;
		else
			cout << "No" << endl;
	}
}