/*
TASK:cannibal
LANG:C++
*/

#include <stdio.h>
#include <algorithm>
#include <queue>

#define MOD 3

using namespace std;

#define IN "test.in"
#define OUT "test.out"

#define MAXN 1024

int N = 102;

int R = 0;
int a[MAXN],b[MAXN];
int read ();

int ans_ref () {
    int ans = 0;
    for (int i=1; i<=N; i++) {
        if (a[i] == -1) continue;
        ans += a[i];
    }
    return ans % MOD;
}

int solve () {
    R = -1;
    for (int i=1; i<=N; i++) {
        if (a[i] == -1 || b[i] == -1) continue;
        if (a[i] != b[i]) {
           R = i;
           break;
        }
    }

    int ans = 0;
    if (R == -1) {
       ans = ans_ref();
       printf("%d\n",ans);
       return 0;
    }

    int t = 0;
    ans = b[R];
    for (int i=1; i<=N; i++) {
        if (a[i] != -1 && i != R) t += a[i];
    }
    t %= MOD;

    if ( t < ans ) printf("%d\n",ans-t);
    else if ( t > ans ) printf("%d\n",ans+3-t);
    else printf("%d\n",0);
    return 0;
}

int main () {
//    freopen(IN,"r",stdin);
//    freopen(OUT,"w",stdout);
    
    read();
    solve();
    return 0;
}

int read () {
    for (int i=1; i<=N; i++) scanf("%d",&a[i]);
    for (int i=1; i<=N; i++) scanf("%d",&b[i]);
    return 0;
}

