#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

ll mos[3]={1000000007,1000000009,998244353};

int K;
string S[202020];
ll T[202020];

ll modpow(ll a, ll n,ll mo) {
	ll r=1;a%=mo;
	while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1;
	return r;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>K;
	FOR(i,K) cin>>S[i]>>T[i];
	
	FOR(k,3) {
		ll mo=mos[k];
		ll ret[2]={};
		ll H[10];
		FOR(i,10) H[i]=rand();
		FOR(r,2) {
			ll h=0;
			
			FOR(i,K) {
				ll d=T[i]%(mo-1)*S[i].size()%(mo-1);
				h=h*modpow(10,d,mo)%mo;
				ll v=0;
				ll a=S[i].size();
				FOR(j,a) v=(v*10+S[i][j]-'0')%mo;
				v=v*(modpow(10,a*(T[i]%(mo-1)),mo)-1)%mo*modpow(modpow(10,a,mo)-1,mo-2,mo)%mo;
				(h+=v)%=mo;
			}
			
			
			ret[r]=h;
			reverse(S,S+K);
			reverse(T,T+K);
			FOR(i,K) reverse(ALL(S[i]));
		}
		if(ret[0]!=ret[1]) {
			cout<<"No"<<endl;
			return;
		}
	}
	cout<<"Yes"<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}