#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define MAXN 100050
#define ll long long
#define INFi 0x3f3f3f3f
#define INFl 0x3f3f3f3f3f3f3f3fll
using namespace std;
int a[MAXN],b[MAXN],d[MAXN],f[MAXN],h[MAXN][2],cnt;
ll g[MAXN],y[MAXN],ANS2;
int N,ANS1;
struct Link{int head[MAXN],nxt[MAXN];Link(){memset(head,-1,sizeof(head));}void Add(int u,int p){nxt[p]=head[u]; head[u]=p;}
}lk;
struct BIT{int val[MAXN],N;int Lowbit(int x){return x&-x;}void Reset(int n){N=n; memset(val,0xc0,sizeof(val));}void Modify(int p,int v){while(p<=N) val[p]=max(val[p],v),p=p+Lowbit(p);}int Query(int p){static int ret; ret=-INFi;while(p) ret=max(ret,val[p]),p-=Lowbit(p);return ret;}
}DT;
double slope(int i,int j){return 1.0*(y[i]-y[j])/(-d[i]-(-d[j]));
}
struct STK{int s[MAXN],top;void Reset(){top=0;}void Push(int i){if(top&&d[i]==d[s[top]]) top--;while(top>1&&slope(i,s[top])>slope(s[top],s[top-1])) top--;s[++top]=i;}ll Query(int i){static int l,r,mid,ret;if(!top) return INFl;l=1; r=top-1; ret=top;while(l<=r){mid=(l+r)>>1;if(slope(s[mid],s[mid+1])<i) ret=mid,r=mid-1;else l=mid+1; }return y[s[ret]]+1ll*i*d[s[ret]];}
}S;
void read(int &x){static int sign; static char ch;x=0; sign=1; ch=getchar();while(ch<'0'||'9'<ch){if(ch=='-')sign=-1;ch=getchar();}while('0'<=ch&&ch<='9'){x=x*10+ch-'0';ch=getchar();}x=x*sign;
}
bool cmp(int i,int j){return d[i]==d[j]?y[i]>y[j]:d[i]<d[j];
}
void solve(int l,int r){static int L[MAXN],R[MAXN],cl,cr;if(l==r) return;int mid=(l+r)>>1;solve(l,mid); solve(mid+1,r); S.Reset();  cl=cr=0;for(int i=l;i<=mid;i++) if(!h[i][1]) L[++cl]=h[i][0];for(int i=mid+1;i<=r;i++) if(h[i][1]) R[++cr]=h[i][0];if(!cl||!cr) return;sort(L+1,L+cl+1,cmp); sort(R+1,R+cr+1,cmp);for(int i=1,j=1;i<=cr;i++){while(j<=cl&&d[L[j]]<=d[R[i]]) S.Push(L[j]),j++;g[R[i]]=min(g[R[i]],S.Query(R[i]));}
}
int main(){static int tmp[MAXN],tnt;read(N); tmp[tnt=1]=0; ANS2=INFl;for(int i=1;i<=N;i++) read(a[i]),tmp[++tnt]=d[i]=a[i]-i;for(int i=1;i<=N;i++) read(b[i]);sort(tmp+1,tmp+tnt+1);tnt=unique(tmp+1,tmp+tnt+1)-tmp-1;DT.Reset(tnt); int p=lower_bound(tmp+1,tmp+tnt+1,0)-tmp;DT.Modify(p,0);for(int i=1;i<=N;i++){g[i]=INFl;p=lower_bound(tmp+1,tmp+tnt+1,d[i])-tmp;f[i]=DT.Query(p)+1; DT.Modify(p,f[i]);}ANS1=DT.Query(tnt);for(int i=N;~i;i--) if(f[i]>=0) lk.Add(f[i],i);for(int q=0,j,k;q<ANS1;q++){cnt=0; j=lk.head[q]; k=lk.head[q+1];while(~j||~k){++cnt;if(!~j) h[cnt][0]=k,h[cnt][1]=1,k=lk.nxt[k];else if(!~k||j<k) h[cnt][0]=j,h[cnt][1]=0,j=lk.nxt[j];else h[cnt][0]=k,h[cnt][1]=1,k=lk.nxt[k];}//按序号排好序solve(1,cnt);//分治for(int i=lk.head[q+1];~i;i=lk.nxt[i]){g[i]+=1ll*(i-1)*i/2+a[i]+b[i];y[i]=g[i]-1ll*(i+1)*a[i]+1ll*i*(i+1)/2;}}for(int i=0;i<=N;i++) if(f[i]==ANS1)ANS2=min(ANS2,g[i]+1ll*(2*a[i]+N-i+1)*(N-i)/2);printf("%d %lld",ANS1,ANS2);return 0;
}