#include<bits/stdc++.h>
using namespace std;
#define MAXN 1000005
long long  n,m,ansz=-1,ans=1;
struct node{
    int a,b;
}s[MAXN];
bool cmp(node a,node b){
    return max(a.a,a.b)<max(b.b,b.a);
}
int main(){
    freopen("Mex.in","r",stdin);
    freopen("Mex.out","w",stdout);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)cin>>s[i].a;
    for(int i=1;i<=n;i++)cin>>s[i].b;
    sort(s+1,s+1+n,cmp);
    for(int i=1;i<=n;i++){
        int c=max(s[i].a,s[i].b);
        if(c>i-1){
            ansz=i-1;
            break;
        }
    }
    if(ansz==-1)ansz=n;
    for(int i=1;i<=n;i++){
        if(s[i].a!=ansz&&s[i].b!=ansz)ans=(ans*2)%1000000007;
    }
    cout<<ansz<<" "<<ans;
    return 0;
}