#include <iostream> using namespace std; int a[1<<20], b[1<<20], nxt[1<<20]; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n, ch = 1, ans1 = 0, ans2 = 0, mn = 0; cin>>n; for (int i=0;i<n;i++) cin>>a[i]>>b[i], mn = max(mn, b[i]), nxt[i] = i+1; nxt[n-1] = 0; while (ch){ ch = 0; for (int i=0;i<n;i++){ int k = max(0, a[i] - b[i]) >> 1; ch += !!k; a[nxt[i]] += k; a[i] -= k<<1; } } for (int i=0;i<n;i++){ if (a[i] == b[i]) ans1++; else if (a[i] == b[i] + 1) ans2++; } if (ans1 == n or (ans2 == n and mn > 0)) cout<<"Yes\n"; else cout<<"No\n"; }