#include<bits/stdc++.h>
using namespace std;

#define int long long

typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

int T;
int t[30];
int m[100];

int dp[111][30];

void solve(){
    rep(i,T)cin>>t[i];


    fill_n(m,100,1001001);
    int N;cin>>N;
    while(N--){
        int D,M;
        cin>>D>>M;
        D--;
        chmin(m[D],M);
    }


    fill_n(*dp,111*30,1<<25);
    dp[0][0]=0;
    rep(i,100){
        rep(j,T){
            if(t[j]<=m[i]){
                chmin(dp[i+1][(j+1)%T],dp[i][j]);
            }
            chmin(dp[i+1][1%T],dp[i][j]+1);
        }
    }
    int ans=1<<25;
    rep(i,T)chmin(ans,dp[100][i]);
    cout<<ans<<endl;
}

signed main(){
    while(cin>>T,T)solve();
    return 0;
}