#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
using namespace std;
const int N = 1e6+5;
int n, x, a[N][2], b[N][2];
void reset()
{
for (int i=0;i<n;++i)
for (int j=0;j<2;++j)
b[i][j]=a[i][j];
}
bool solve(int k)
{
for (int i=0;i<n*100;++i)
{
x=b[(k+i)%n][0]-b[(k+i)%n][1];
if (x>0&&b[(k+i)%n][0]>1)
{
b[(k+i)%n][0]-=((x+1)/2)*2;
b[(k+i+1)%n][0]+=(x+1)/2;
}
}
for (int i=0;i<n;++i)
if (b[i][0]!=b[i][1])
return 0;
return 1;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>n;
for (int i=0;i<n;++i)
cin>>a[i][0]>>a[i][1];
for (int i=0;i<n;++i)
{
reset();
if (solve(i))
{
cout<<"Yes";
return 0;
}
}
cout<<"No";
return 0;
}
