//set many funcs template
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<stdbool.h>
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int max(int a,int b){if(a>b){return a;}return b;}
int min(int a,int b){if(a<b){return a;}return b;}
int zt(int a,int b){return max(a,b)-min(a,b);}
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}
int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
long long llmax(long long a,long long b){if(a>b){return a;}return b;}
long long llmin(long long a,long long b){if(a<b){return a;}return b;}
long long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}
long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}
long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}
long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}
long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
double dbmax(double a,double b){if(a>b){return a;}return b;}
double dbmin(double a,double b){if(a<b){return a;}return b;}
double dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}
int sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int main(void){
int i,j,n,k,a[262144],b[262144]={0};
int x=0,y=0,t;
scanf("%d",&n);
for(i=1;i<=n;i++){scanf("%d",&a[i]);b[a[i]]++;}
for(i=1;i<=n;i++){
if(b[i]!=0){
if(x==0){x=i;}
else if(y==0){y=i;}
else{printf("No\n");return 0;}
}
}
if(y==0){
if(x==n-1 || x<=(n/2)){printf("Yes\n");}
else{printf("No\n");}
}
else{
if(y-x!=1){printf("No\n");return 0;}
t=n-b[x];
t/=2;
if(b[x]+1<=y && y <= b[x]+t){printf("Yes\n");}else{printf("No\n");}
}
return 0;
}
./Main.c:14:5: warning: conflicting types for built-in function ‘round’
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
^
./Main.c:15:5: warning: conflicting types for built-in function ‘ceil’
int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
^
./Main.c:20:5: warning: conflicting types for built-in function ‘pow’
int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
^
./Main.c:24:11: warning: conflicting types for built-in function ‘llround’
long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
^
./Main.c: In function ‘main’:
./Main.c:44:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.c:45:23: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
for(i=1;i<=n;i++){scanf("%d",&a[i]);b[a[i]]++;}
^