#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

int main() {
    int n; cin >> n;

    auto a = vec<int>(uns, n);
    auto b = vec<int>(uns, n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i] >> b[i];
    }

    auto idx = vec<int>(uns, n);
    iota(begin(idx), end(idx), 0);
    sort(begin(idx), end(idx), [&](auto x, auto y) {
        return a[x] + b[x] < a[y] + b[y];
    });

    auto bsearch = [&](auto x) {
        return lower_bound(begin(idx), end(idx), x, [&](auto x, auto y) {
            return a[x] + b[x] < y;
        });
    };

    auto last = end(idx);

    auto sum = accumulate(begin(a), end(a), int64_t(0));
    while (begin(idx) != last) {
        auto iter = bsearch(sum);

        for_each(iter, last, [&](auto x) {
            sum -= a[x];
        });

        if (iter == last) {
            break;
        }

        last = iter;
    }

    cout << (begin(idx) == last ? "Yes" : "No") << endl;
}