#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <queue>
using namespace std;
int main()
{
    int N;
    cin >> N;
    long long X, Y;
    cin >> X >> Y;
    vector<long long> R(N);
    for (int i = 0; i < N; i++)
        cin >> R[i];
    long long sum = 0;
    for (int i = 0; i < N; i++)
    {
        sum += R[i] * 2;
    }
    sort(R.begin(), R.end());
    sum -= R[0];
    if (N == 1)
    {
        if (X * X + Y * Y == R[0] * R[0])
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }
    else if ((X * X + Y * Y) / sum < sum)
        cout << "Yes" << endl;
    else if ((X * X + Y * Y) / sum == sum)
    {
        if ((X * X + Y * Y + sum - 1) / sum == sum)
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }
    else
        cout << "No" << endl;
}