#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = 60 + 10,
          MIN = -1'000'000'000'000'000'000;
int n;
struct Student {
  int l, r;
  friend istream& operator >> (istream& is, auto& rhs) { 
    return is >> rhs.l >> rhs.r;
  }
} s[N];
int w[N];

map<int, int> f;
map<int, int> value;

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);

  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> s[i];
  for (int i = 1; i <= n; ++i) cin >> w[i];

  for (int mask = 1; mask < (1ll << n); ++mask) { 
    int l = 1, r = n;
    for (int i = 1; i <= n; ++i) { 
      if (!(mask >> i - 1 & 1)) continue;
      l = max(l, s[i].l);
      r = min(r, s[i].r);
    }
    
    value[mask] = MIN;
    int cnt = __builtin_popcount(mask);
    for (int j = l; j <= r; ++j)
      if (!(cnt % j)) value[mask] = max(value[mask], cnt / j * w[j]);
  }
  
  f[0] = 0;
  for (int mask = 1; mask < (1ll << n); ++mask) { 
    auto& ret = f[mask]; ret = MIN;
    for (int submask = mask; submask; submask = submask - 1 & mask)
      ret = max(ret, f[mask ^ submask] + value[submask]);
  }

  if (f[(1ll << n) - 1] == MIN) cout << "impossible\n";
  else cout << f[(1ll << n) - 1] << "\n";
}