#include<iostream>
#include<cstdio>
#include<cmath>
#define lowbit(x) x&(-x)
#include<queue>
#include<algorithm>
#define ll long long
using namespace std;
int n,ti,a[1000005][62],b[62],cnt,ff[62],sz,h[50005];
void dfs(int t,int sum){
	ti++;
	if(t==1){
		cnt++,a[cnt][1]=n-sum;
		for(int i=2;i<=n;++i) a[cnt][i]=b[i];
		return;
	}
	for(int i=0;sum+i*t<=n;++i){
		b[t]=i;
		dfs(t-1,sum+i*t);
	}
}
struct node{
	int l,r;
}p[500005];
int w[500005],ans=-1e9;
bool cmp(node x,node y){
	if(x.l==y.l) return x.r<y.r;
	return x.l<y.l;
}
priority_queue<int,vector<int>,greater<int> >q;
void ins(int x){
	sz++,h[sz]=x;
	int now=sz;
	while(now>1&&h[now/2]>h[now]) swap(h[now/2],h[now]),now/=2;
}
void del(){
	swap(h[1],h[sz]);
	sz--;
	int now=1;
	while(now<=sz){
		if(h[now*2]<h[now]&&now*2<=sz) swap(h[now*2],h[now]),now=now*2;
		else if(h[now*2+1]<h[now]&&now*2+1<=sz) swap(h[now*2+1],h[now]),now=now*2+1;
		else break;
	}
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i) scanf("%d%d",&p[i].l,&p[i].r);
	sort(p+1,p+n+1,cmp);
	for(int i=1;i<=n;++i) scanf("%d",&w[i]);
	dfs(n,0);
	for(int i=1;i<=cnt;++i){
		int val=0;
		for(int j=1;j<=n;++j) val+=w[j]*a[i][j],ff[j]=j*a[i][j];
		int now=1,flag=0;
		sz=0;
		for(int j=1;j<=n;++j){
			while(p[now].l==j) ins(p[now].r),now++;
			while(ff[j]){
				if(!sz){
					flag=1;
					break;
				}
				int x=h[1];
				if(x<j) flag=1;
				if(flag) break;
				del();
				ff[j]--;
			}
			if(flag) break;
		}
		if(flag) continue;
		ans=max(ans,val);
	}
	if(ans==-1e9) printf("impossible");
	else printf("%d",ans);
}