#include <cstdlib>
#include <iostream>
#include <stdio.h>
#include <cstring>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <map>
#include <stack>
#include <cmath>
#include <set>
#include <ctype.h>
#include <bitset>

#define INF 0x3F3F3F3F
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb push_back
#define clr(a) memset((a),0,sizeof(a))
#define pi 3.1415926535897932384626433832795028841971
#define debug(x) cout << #x << " = " << x << endl;
#define debug2(x,y) cout << #x << " = " << x << " --- " << #y << " " << y << "\n";
#define all(S) (S).begin(), (S).end()
#define MAXV 1005
#define F first
#define S second
#define EPS 1e-9
#define mp make_pair

// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);

using namespace std;

typedef long long ll;
typedef pair < int, int >  ii;
typedef vector < int >  vi;
typedef vector < ii >  vii;

int n;
int posto[1002];
int gasta[1002];

bool horario(int start){

    int cnt = 0;
    int atual = start;
    int qtd = 0;

    while(cnt != n){

        qtd += posto[atual];
        qtd -= gasta[atual];

        if(qtd < 0) return false;

        atual++;
        if(atual > n) atual = 1;
        cnt++;
    }

    return true;
}


bool ant(int start){

    int cnt = 0;
    int atual = start;
    int qtd = 0;

    while(cnt != n){

        qtd += posto[atual];
        int next = atual - 1;
        if(next == 0) next = n;
        qtd -= gasta[next];

        if(qtd < 0) return false;

        atual--;
        if(atual == 0) atual = n;
        cnt++;
    }

    return true;
}

int main(){

    int ansH, ansA;

    while(scanf("%d",&n) && n){

        rep(i,1,n+1)
            scanf("%d",&posto[i]);
        rep(i,1,n+1)
            scanf("%d",&gasta[i]);

        ansH = ansA = -1;

        rep(i,1,n+1){
            bool ok = horario(i);
            if(ok){
                ansH = i;
                break;
            }
        }

        rep(i,1,n+1){
            bool ok = ant(i);
            if(ok){
                ansA = i;
                break;
            }
        }

        printf("%d %d\n",ansH,ansA);
    }

    return 0;
}