#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>
#include<random>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, -1, 0, 1};
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

bool ok(vi X) {
    int diff = X[1]-X[0];
    int N = X.size();
    if (diff == 0) return false;
    for (int i = 1; i+1 < N; i++) {
        if (X[i+1]-X[i] != diff) return false;
    }
    return true;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<int> X(N);
    for (int i = 0; i < N; i++)
        cin >> X[i];
    sort(X.begin(), X.end());
    if (ok(X)) cout << "YES" << endl;
    else cout << "NO" << endl;
    return 0;
}