#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using ll = long long;

using namespace std;

const int INF = 1e9;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int n;
    cin >> n;
    vector<int> l(n), r(n);
    for (int i = 0; i < n; i++) cin >> l[i] >> r[i];
    vector<int> w(n + 1);
    for (int i = 1; i <= n; i++) cin >> w[i];

    vector<int> cnt(n + 1, 0);
    vector<int> ord(n);
    iota(ord.begin(), ord.end(), 0);
    ranges::sort(ord, {}, [&](int i) { return l[i]; });
    priority_queue<int, vector<int>, greater<int>> pq;
    auto check = [&]() -> bool {
        while (not pq.empty()) pq.pop();
        for (int i = 1, j = 0; i <= n; i++) {
            if (cnt[i] == 0) continue;
            for (; j < n and l[ord[j]] <= i; j++) pq.emplace(r[ord[j]]);
            if (int(pq.size()) < i * cnt[i] or pq.top() < i) return false;
            for (int k = 0; k < i * cnt[i]; k++) pq.pop();
        }
        return true;
    };
    int ans = -INF;
    auto dfs = [&](auto self, int nxt, int rest) -> void {
        if (nxt == 1) {
            cnt[nxt] = rest;
            if (check()) {
                int sum = 0;
                for (int i = 1; i <= n; i++) sum += w[i] * cnt[i];
                ans = max(ans, sum);
            }
            return;
        }
        for (int i = 0; i <= rest / nxt; i++) {
            cnt[nxt] = i;
            self(self, nxt - 1, rest - nxt * i);
        }
    };
    dfs(dfs, n, n);

    if (ans == -INF) {
        cout << "impossible\n";
    } else {
        cout << ans << "\n";
    }
    return 0;
}