#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int> plus, minus;
    for (int i = 0; i < n; ++i)
    {
        int a;
        cin >> a;
        if (a > 0)
        {
            plus.push_back(a);
        }
        else if (a < 0)
        {
            minus.push_back(a);
        }
    }
    sort(plus.begin(), plus.end(), greater<int>());
    sort(minus.begin(), minus.end());
    while (plus.size() && minus.size()){
        int p = plus.back();
        plus.pop_back();
        int m = minus.back();
        minus.pop_back();
        int s = p + m;
        if (s > 0){
            plus.push_back(p);
        }
        else if (s < 0){
            minus.push_back(s);
        }
    }
    
    if (plus.size() + minus.size() <= 1){
        cout << "Yes" << endl;
    }
    else{
        cout << "No" << endl;
    }
}