#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/modint>
random_device seed_gen;
mt19937 rng(seed_gen());
long long rand_long(long long l,long long r){
    return uniform_int_distribution<long long>(l,r-1)(rng);
}


template<class T>
T my_pow(T a, ll k){
    return (1 - a.pow(k)) / (1 - a);
}

void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll K;
    cin >> K;
    vector<string> S(K);
    vector<ll> T(K);
    rep(i, 0, K){
        cin >> S[i] >> T[i];
    }
    {
        using mint = atcoder::modint;
        int MOD;
        while (true){
            MOD = rand_long(1 << 28, 1 << 30);
            bool prime = true;
            ll a = 2;
            while (a * a <= MOD){
                if (MOD % a == 0){
                    prime = false;
                    break;
                }
            }
            if (prime) break;
        }
        mint::set_mod(MOD);
        vector<mint> hash(10);
        rep(i, 0, 10) hash[i] = rand_long(0, mint::mod());
        mint base = rand_long(0, mint::mod());
        //rep(i, 0, 10) hash[i] = i;
        auto f = [&]() -> mint {
            mint res = 0;
            rep(i, 0, K) {
                mint sum = 0;
                mint bs = 1;
                for (auto c: S[i]) {
                    sum *= base;
                    bs *= base;
                    sum += hash[c - '0'];
                }
                res *= bs.pow(T[i]);
                res += sum * my_pow(bs, T[i]);
            }
            return res;
        };
        mint A = f();
        reverse(all(S));
        reverse(all(T));
        rep(i, 0, K) reverse(all(S[i]));
        mint B = f();
        if (A != B){
            cout << "No\n";
            return;
        }
    }



    cout << "Yes\n";
}