#include <bits/stdc++.h>

using namespace std;
constexpr int K = 12;

struct node {
    map<int, int> go;
    int sz{0};
    int who{-1};
};
vector<node> all;

int create() {
    all.emplace_back();
    return all.size() - 1;
}


int main() {
    cin.tie(0)->sync_with_stdio(false);
    mt19937 rng{1000-7};
    vector<int> p(K);
    iota(p.begin(),p.end(),0);
    shuffle(p.begin(),p.end(),rng);
    int n;
    cin >> n;
    vector<array<int, K>> a(n);
    int root = create();
    queue<int> q;
    q.push(0);
    for (int i = 0; i < n; ++i) {
        int x;
        cin >> x;
        int cur = root;
        if (i)all[cur].sz++;
        for (int j = 0; j < K; ++j, x /= 3) a[i][j] = x % 3;
        {
            array<int,K> z;
            for(int j = 0;j < K;++j)z[j]=a[i][p[j]];
            swap(a[i],z);
        }
        for (int j = 0; j < K; ++j) {
            if (!all[cur].go.count(a[i][j])) {
                all[cur].go[a[i][j]] = create();
            }
            cur = all[cur].go[a[i][j]];
            if (i)all[cur].sz++;
        }
        all[cur].who = i;
    }
    vector<char> done(n); done[0] = 1;
    while (q.size() && !done[n - 1]) {
        int p = q.front();
        q.pop();
        auto dfs = [&](auto &&dfs, int v = 0, int bal = 0, int d = 0) -> int {
            if (!all[v].sz || bal > 1)return 0;
            if (d == K) {
                --all[v].sz;
                q.push(all[v].who);
                done[all[v].who] = 1;
                return 1;
            }
            int z = 0;
            for (auto [x, to]: all[v].go) {
                z += dfs(dfs,to,bal + (x < a[p][d]),d + 1);
            }
            all[v].sz-=z;
            return z;
        };
        dfs(dfs);
    }
    cout << (done[n-1]?"Yes":"No");
}