#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <iomanip>

using namespace std;

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N-1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N-1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;

template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
struct mll {
	static ll MOD;
	ll val;
	mll(ll v = 0) : val(v % MOD) { if (val < 0) val += MOD; }
	mll operator - () const { return -val; }
	mll operator + (const mll &b) const { return val + b.val; }
	mll operator - (const mll &b) const { return val - b.val; }
	mll operator * (const mll &b) const { return val * b.val; }
	mll operator / (const mll &b) const { return mll(*this) /= b; }
	mll operator + (ll b) const { return *this + mll(b); }
	mll operator - (ll b) const { return *this - mll(b); }
	mll operator * (ll b) const { return *this * mll(b); }
	friend mll operator + (ll a, const mll &b) { return b + a; }
	friend mll operator - (ll a, const mll &b) { return -b + a; }
	friend mll operator * (ll a, const mll &b) { return b * a; }
	mll &operator += (const mll &b) { val = (val + b.val) % MOD; return *this; }
	mll &operator -= (const mll &b) { val = (val + MOD - b.val) % MOD; return *this; }
	mll &operator *= (const mll &b) { val = (val*b.val) % MOD; return *this; }
	mll &operator /= (const mll &b) {
		ll c = b.val, d = MOD, u = 1, v = 0;
		while (d) {
			ll t = c / d;
			c -= t * d; swap(c, d);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	mll &operator += (ll b) { return *this += mll(b); }
	mll &operator -= (ll b) { return *this -= mll(b); }
	mll &operator *= (ll b) { return *this *= mll(b); }
	mll &operator /= (ll b) { return *this /= mll(b); }
	bool operator == (const mll &b) { return val == b.val; }
	bool operator != (const mll &b) { return val != b.val; }
	bool operator == (ll b) { return *this == mll(b); }
	bool operator != (ll b) { return *this != mll(b); }
	friend bool operator == (ll a, const mll &b) { return mll(a) == b.val; }
	friend bool operator != (ll a, const mll &b) { return mll(a) != b.val; }
	friend ostream &operator << (ostream &os, const mll &a) { return os << a.val; }
	friend istream &operator >> (istream &is, mll &a) { return is >> a.val; }
	static mll Combination(ll a, ll b) {
		chmin(b, a - b);
		if (b < 0) return mll(0);
		mll c = 1;
		rep(i, b) c *= a - i;
		rep(i, b) c /= i + 1;
		return c;
	}
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;

struct Fast {
	Fast() {
		cin.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
	}
} fast; //cin,cout高速化のおまじない＋桁数指定

ll mll::MOD = (ll)(1e9 + 7);// 998244353ll;

//--debug--
#ifdef LOCAL
void _debug_out_(string s = "") {
	if (s != "") { eprintf(s.c_str()); } else { eprintf("\n"); }
}
void _debug_out_(ll x, string s = "") {
	if (s != "") { eprintf(s.c_str(), x); }	else { eprintf("%lld\n", x); }
}
void _debug_out_(vvll x, string s = "") {
	string t = s;
	if (s == "") {
		ll maxLen = 0;
		rep(i, (ll)x.size()) rep(j, (ll)x[i].size()) {
			ll n = x[i][j] / 10, len = 1;
			while (n > 0) { len++; n /= 10; }
			chmax(maxLen, len);
		}
		t = "%" + to_string(maxLen) + "lld ";
	}
	rep(i, (ll)x.size()) { rep(j, (ll)x[i].size()) { eprintf(t.c_str(), x[i][j]); } eprintf("\n"); }
	eprintf("\n");
}
void _debug_out_(vll x, string s = "") {
	rep(i, (ll)x.size()) { if (s != "") { eprintf(s.c_str(), x[i]); } else { eprintf("%lld ", x[i]); } }
	eprintf("\n");
}
void _debug_out_(vector<bool> x) {
	rep(i, (ll)x.size()) { eprintf("%s", x[i] ? "o" : "x");	}
	eprintf("\n");
}
void _debug_out_(vector<vector<bool>> x) {
	rep(i, (ll)x.size()) { rep(j, (ll)x[i].size()) { eprintf("%s", x[i][j] ? "o" : "x"); } eprintf("\n"); }
	eprintf("\n");
}
void _debug_out_(map<ll, ll> x) {
	auto begin = x.begin(), end = x.end();
	for (auto iter = begin; iter != end; iter++) {
		eprintf("%lld:%lld ", iter->first, iter->second);
	}
	eprintf("\n");
}
#define debug_out(...) _debug_out_(__VA_ARGS__)
#else
#define debug_out(...) 42
#endif
//--debug--



void debug(vll &A, ll C, ll next) {
	if (next >= (ll)A.size()) {
		set<ll> t;
		vll B(A.size());
		rep(i, (ll)A.size()) {
			B[i] = A[i];
			t.insert(A[i]);
		}
		if ((ll)t.size() != C) {
			return;
		}
		std::sort(B.begin(), B.end());

		vll count(B.size(), 0);
		map<ll, ll> mp;
		rep(i, (ll)B.size()) {
			set<ll> s;
			rep(j, (ll)B.size()) {
				if (i == j) {
					continue;
				}
				s.insert(B[j]);
			}
			count[i] = s.size();
			mp[count[i]]++;
		}
		//debug_out(B, "%lld");
		//debug_out(count, "%lld");
		debug_out(mp);
		//debug_out();
		return;
	}

	ll start = 0;
	if (next > 0) {
		start = A[next - 1];
	}
	reps(i, start, C - 1) {
		A[next] = i;
		debug(A, C, next + 1);
	}
}

int main() {
	ll x = 3;
	reps(i, 1, x) {
		debug_out("<>C=" + to_string(i) + "\n");
		vll A(x);
		debug(A, i, 0);
	}

	ll N;
	cin >> N;
	vector<ll> A(N);
	rep(i, N) {
		cin >> A[i];
	}

	map<ll, ll> mp;
	rep(i, N) {
		if (A[i] < 1 || A[i] > N - 1) {
			cout << "No" << endl;
			return 0;
		}
		mp[A[i]]++;
	}

	ll kind = 0;
	ll low = INF;
	ll high = 0;
	ll cLow = 0;
	auto begin = mp.begin(), end = mp.end();
	for (auto iter = begin; iter != end; iter++) {
		kind++;
		if (iter->first < low) {
			low = iter->first;
			cLow = iter->second;
		}
		chmax(high, iter->first);
	}

	if (kind > 2) {
		cout << "No" << endl;
		return 0;
	}
	else if (kind == 1) {
		if ((low >= 1 && low <= N / 2) || low == N - 1) {
			cout << "Yes" << endl;
		}
		else {
			cout << "No" << endl;
		}
	}
	else if(kind == 2){ //kind == 2
		if (high - low != 1) {
			cout << "No" << endl;
		}
		else if (low + 1 >= 2 && low + 1 <= N - 1) {
			ll m = 0;
			if (N % 2 == 0) {
				if (low >= N / 2) {
					m = N - 1 - low;
				}
				else {
					m = low;
				}
			}
			else {
				m = N / 2 - abs(N / 2 - low);
			}

			if (cLow <= low && cLow >= low - m + 1) {
				cout << "Yes" << endl;
			}
			else {
				cout << "No" << endl;
			}
		}
		else {
			cout << "No" << endl;
		}
	}

	return 0;
}



Measured memory_bytes: 7296