#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
#include<tuple>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;




int main(){
    ll n;
    cin>>n;
    vector<ll> c(n);
    for(auto &I:c){cin>>I;}
    ll q;
    cin>>q;
    vector<ll> a(n,0);
    while(q--){
        ll t,x,d;
        cin>>t>>x>>d;
        t--; x--;
        if(t){
            if(a[x]<d){cout<<x+1<<endl; return 0;}
            a[x]-=d;
        }
        else{
            if(a[x]+d>c[x]){cout<<x+1<<endl; return 0;}
            a[x]+=d;
        }
    }
    cout<<0<<endl;
    
    return 0;
}

