#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
using namespace std;
#define ll long long/
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
using namespace std;
#define int long long
const int mod=1e9+7,mxn=1e6+5,lg=30,inf=1e18,minf=-1e18;
int val[mxn+10],need[mxn+10];
int32_t main(){
fastio
int n;cin>>n;
int nsum=0,sum=0;
for(int i=0;i<n;i++){
cin>>val[i]>>need[i];
sum+=val[i];
nsum+=need[i];
}
if(nsum==0){
if(sum)cout<<"No";
else cout<<"Yes";
return 0;
}
bool yes=false,b=false;
while(sum>=nsum){
yes=true;
b=true;
for(int i=0;i<n;i++){
if(val[i]<=need[i])continue;
int k=ceil(1.0*(val[i]-need[i])/2);
sum-=k;
val[(i+1)%n]+=k;
val[i]-=k*2;
b=false;
}
for(int i=0;i<n;i++)if(val[i]!=need[i])yes=false;
if(yes){
cout<<"Yes";
return 0;
}
if(b)break;
}
yes=true;
for(int i=0;i<n;i++)if(val[i]!=need[i])yes=false;
if(yes){
cout<<"Yes";
return 0;
}
cout<<"No";
return 0;
}
