// #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()

template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = int64_t;
using ull = uint64_t;
using PLL = pair<ll, ll>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return max(low, min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { t = clamp(t, low, high); }

namespace init__ {

struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

}

#ifdef DEBUGGING
// #include "../debug/debug.cpp"
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

template <typename T>
T make_v(T init) { return init; }

template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
    return V<decltype(rec)>(s, rec);
#undef rec
}

bool solve() {
    ll N;
    cin >> N;
    map<ll, ll> cnt;
    for(ll i = 0; i < N; i++) {
        ll e;
        cin >> e;
        cnt[e]++;
    }

    if(cnt.size() >= 4) return false;
    ll a = N / 3 + (N % 3 >= 1);
    ll b = N / 3 + (N % 3 >= 2);
    ll c = N / 3;
    V<ll> num = { a, b, c, };
    V<ll> idx = { 0, 1, 2, };
    V<ll> clis;
    for(auto &&ele : cnt) clis.push_back(ele.second);
    do {
        auto cpy = clis;
        ll cpy_idx = 0;
        bool ok = true;
        for(ll i = 0; i < 3; i++) {
            ll n = num[idx[i]];
            if(cpy[cpy_idx] < n) {
                ok = false;
                break;
            }
            cpy[cpy_idx] -= n;
            if(!cpy[cpy_idx]) cpy_idx++;
        }
        if(ok) return true;
    } while(next_permutation(ALL(idx)));

    return false;
}

int main() {
    cout << (solve() ? "Yes" : "No") << endl;
    return 0;
}
