#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
// typedef __int128 ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define db double
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bin(x) (1ll<<(x))
#define fo(i,l,r) for(int i=(l),I=(r);i<=I;i++)
#define fd(i,r,l) for(int i=(r),I=(l);i>=I;i--)
#define mem(x,val) memset(x,val,sizeof x)
#define Swap(a,b,n) for(int I=0;I<=n;I++) swap(a[I],b[I])
#define PC __builtin_popcountll
#ifdef DEBUG
	#define debug(A,args...) fprintf(stderr,A,##args)
#else
	#define debug(A,args...) printf("")
#endif
#define deb debug("line %d\n",__LINE__)
namespace mine
{
	ll qread()
	{
		ll ans=0,f=1;char c=getchar();
		while(c<'0' or c>'9') {if(c=='-')f=-1;c=getchar();}
		while('0'<=c and c<='9') ans=ans*10+c-'0',c=getchar();
		return ans*f;
	}
	void write(ll num){if(num<0) putchar('-'),num=-num;if(num>=10) write(num/10);putchar('0'+num%10);}
	void write1(ll num){write(num);putchar(' ');}
	void write2(ll num){write(num);putchar('\n');}
	template<typename T>inline bool chmax(T&a,const T&b){return a<b?a=b,1:0;}
	template<typename T>inline bool chmin(T&a,const T&b){return a>b?a=b,1:0;}
	ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
	bool IN(ll x,ll l,ll r){return l<=x and x<=r;}
	void GG(){puts("-1");exit(0);}
	
	const db eps=1e-8;
	const int INF=0x3f3f3f3f;
	const int MOD=1e9+7;
	int mm(const int x){return x>=MOD?x-MOD:x;}
	template<typename T> void add(T &x,const int &y){x=(x+y>=MOD?x+y-MOD:x+y);}
	ll qpower(ll x,ll e,int mod=MOD){ll ans=1;while(e){if(e&1)ans=ans*x%mod;x=x*x%mod;e>>=1;}return ans;}
	ll invm(ll x){return qpower(x,MOD-2);}
	const int MM=1e6+10;
	ll fac[MM],facinv[MM],Inv[MM];ll Comb(int n,int m){return n<0 or n<m?0:fac[n]*facinv[m]%MOD*facinv[n-m]%MOD;}
	void PRE()
	{
		fac[0]=1;fo(i,1,MM-1) fac[i]=fac[i-1]*i%MOD;
		facinv[MM-1]=invm(fac[MM-1]);fd(i,MM-1,1) facinv[i-1]=facinv[i]*i%MOD;
		Inv[1]=1;fo(i,2,MM-1) Inv[i]=(MOD-MOD/i)*Inv[MOD%i]%MOD;
	}
	const int N=2e5+10;
	//------------------FIXED------------------
	namespace SGT
	{
		int mi[N<<2];void clear(){mem(mi,0x3f);}
		#define mid (l+r)/2
		#define lc x<<1
		#define rc x<<1|1
		void cmin(int fl,int fr,int val,int x=1,int l=1,int r=N-1)
		{
			if(l==fl and r==fr){ chmin(mi[x],val);return; }
			if(fr<=mid) cmin(fl,fr,val,lc,l,mid); else if(fl>mid) cmin(fl,fr,val,rc,mid+1,r);
			else cmin(fl,mid,val,lc,l,mid),cmin(mid+1,fr,val,rc,mid+1,r);
		}
		int ask(int pos,int x=1,int l=1,int r=N-1)
		{
			int ret=mi[x];
			if(l<r) chmin(ret,pos<=mid?ask(pos,lc,l,mid):ask(pos,rc,mid+1,r));
			return ret;
		}
	};
	int premin[N];
	int c[N][2];pii a[N];
	void main()
	{
		int n=qread();fo(i,1,n) c[i][0]=c[i-1][0],c[i][1]=c[i-1][1],c[i][qread()]++;
		int m=qread();fo(i,1,m) a[i].SE=qread(),a[i].FR=qread();sort(a+1,a+m+1);
		int ans=c[n][1];premin[0]=0;SGT::clear();
		fo(i,1,m)
		{
			int l=a[i].SE,r=a[i].FR;
			int dp=min(c[r][0]+SGT::ask(l),(c[r][0]-c[l-1][0])+c[l-1][1]+premin[ lower_bound(a,a+i,MP(l,0))-a-1 ]);
			premin[i]=min(premin[i-1],dp-c[r][1]),SGT::cmin(l,r,dp-c[r][0]);
			chmin(ans,dp+c[n][1]-c[r][1]);
		}write(ans);
	}
};//����������
signed main()
{
	#ifdef DEBUG
	//freopen("a.in","r",stdin);
	freopen("z.txt","r",stdin);
	//freopen("a.out","w",stdout);
	#endif
	srand(time(0));
	mine::PRE();
	mine::main();
	debug("\n------------------------------------------\nTime: %.2lf s",1.0*clock()/CLOCKS_PER_SEC);
}

Measured memory_bytes: 30720