#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
/*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
ll pow_mod(ll _a,ll b,ll m){
  __int128 res=1,a=_a%m;
  while(b){
    if(b%2)res=res*a%m;
    a=a*a%m;b/=2;
  }
  return res;
}
bool is_prime(ll N){
  if(N==1)return false;
  if(N==2)return true;
  if(N%2==0)return false;
  ll s=0,d=N-1;
  while(d%2==0)d/=2,s++;
  vector<long long>A={2,325,9375,28178,450775,9780504,1795265022};
  for(auto a:A){
    long long g=__gcd(a,N);
    if(g>1){
      if(g!=N)return false;
      continue;
    }
    __int128 x=pow_mod(a,d,N);
    if(x!=1&&x!=N-1){
      bool ok=0;
      for(int i=0;i<s-1;i++){
        x=x*x%N;
        if(x==N-1){ok=1;break;}
        if(x==1)break;
      }
      if(!ok)return false;
    }
  }
  return true;
}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  
  ll K;cin>>K;
  vector<pair<string,__int128>>A(K),B(K);
  rep(i,0,K){
  	ll t;
  	cin>>A[i].F>>t;
  	A[i].S=t;
  	B[K-1-i]=A[i];
  	reverse(all(B[K-1-i].F));
  }
  vector<__int128>X(K+1),Y(K+1);
  rep(i,0,K)X[i+1]=X[i]+sz(A[i].F)*A[i].S;
  rep(i,0,K)Y[i+1]=Y[i]+sz(B[i].F)*B[i].S;
  vector<__int128>Z=X;
  Z.insert(Z.end(),all(Y));
  sort(all(Z));
  Z.erase(unique(all(Z)),Z.end());
  
  ll p=rand();
  while(!is_prime(p))p=rand();
  mint::set_mod(p);
  mint b=rand(),r=b.inv();
  vvm P(K),Q(K);
  rep(i,0,K){
  	P[i].resize(sz(A[i].F)+1);
  	rep(j,0,sz(A[i].F))P[i][j+1]=P[i][j]+(A[i].F[j]-'0')*b.pow(j);
  }
  rep(i,0,K){
  	Q[i].resize(sz(B[i].F)+1);
  	rep(j,0,sz(B[i].F))Q[i][j+1]=Q[i][j]+(B[i].F[j]-'0')*b.pow(j);
  }
  function<mint(vm&,ll,__int128)>f=[&](vm&R,ll i,__int128 d){
  	ll N=sz(R)-1;
  	assert(0<=i&&i<N);
  	if(i+d<=N)return (R[i+d]-R[i])*r.pow(i);
  	if(i){
  		mint s=f(R,0,d-(N-i));
  		return (R[N]-R[i])*r.pow(i)+s*b.pow(N-i);
  	}
  	ll p=d/N;
  	mint t=b.pow(N);
  	return R[d-N*p]*t.pow(p)+R[N]*(t==1?p:(t.pow(p)-1)/(t-1));
  };
  ll x=0,y=0;
  rep(i,0,sz(Z)-1){
  	if(X[x+1]<=Z[i])x++;
  	if(Y[y+1]<=Z[i])y++;
  	__int128 d=Z[i+1]-Z[i];
  	ll p=(Z[i]-X[x])%sz(A[x].F);
  	ll q=(Z[i]-Y[y])%sz(B[y].F);
  	if(f(P[x],p,d)!=f(Q[y],q,d)){
  		cout<<"No"<<endl;
  		return 0;
  	}
  }
  cout<<"Yes"<<endl;
  return 0;
}