#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <deque>
#include <map>
#include <chrono>
#include <random>
#include <bitset>
#include <tuple>
#define SZ(x) int(x.size())
#define FR(i,a,b) for(int i=(a);i<(b);++i)
#define FOR(i,n) FR(i,0,n)
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define A firsts
#define B second
#define mp(a,b) make_pair(a,b)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef unsigned __int128 U128;
typedef __int128 I128;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;
using namespace std;
const LL MAXN=2e5+5;
LL a[MAXN], b[MAXN];
signed main(){
FAST;
LL n; cin>>n;
LL o1=n+1, o2=n+1;
LL cnt=0;
FR(i,1,n+1){
cin>>a[i];
if (a[i]==2) cnt++;
if (a[i]==2 && o1==n+1 && i>1) o1=i;
}
FR(i,1,n+1){
cin>>b[i];
if (b[i]==2 && i>1) cnt++;
if (b[i]==2 && o2==n+1 && i>1) o2=i;
}
LL a1=(n-o1+1)*(n-1), a2=(n-o2+1)*(n-1), a3=(n-o1+1)*(n-o2+1);
cnt+=(a1+a2-a3);
if (cnt>=n*n-cnt) cout<<2<<" "<<cnt;
else cout<<1<<" "<<n*n-cnt;
return 0;
}
