#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <numeric>

#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
#define INF (int)1e9
#define INFL 1e18
#define MOD 1000000007
#define pb push_back
#define MP make_pair
typedef long long int ll;
typedef std::pair<int,int> P;
int D=1;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

using namespace std;

int main(){
    int n;
    cin>>n;
    vector<int> c(n),v(n,0);
    rep(i,0,n)cin>>c[i];
    
    int q; cin>>q;
    rep(i,0,q){
        int t,x,d;
        cin>>t>>x>>d;
        x--;
        if(t==1){
            v[x]+=d;
            if(v[x]>c[x]){
                cout<<x+1<<endl;
                return 0;
            }
        }else {
            v[x]-=d;
            if(v[x]<0){
                cout<<x+1<<endl;
                return 0;
            }
        }
    }
    cout<<0<<endl;
    
    return 0;
}

