#include<bits/stdc++.h>
#define X first
#define Y second
#define pb emplace_back
#define FOR(i,a,b) for(int (i)=(a);i<(b);++(i))
#define EFOR(i,a,b) for(int (i)=(a);i<=(b);++(i))
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef ll LL;
typedef pii PII;
typedef pll PLL;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
const ll MOD=1e9+7;

int N;
int Q;
int bs[214514];
int dp[214514];

struct MaxOp {
  const static LL INF = 1LL << 61;
  const static auto e = -INF;
  static LL apply(pll &f, LL v, LL w) {return f.X*v + f.Y;};
  static LL mergev(LL a, LL b) {return max(a, b);};
  static pll mergef(pll &f, pll &g) {return pll(f.X*g.X, f.X*g.Y+f.Y);};
};

struct MinOp {
  const static LL INF = 1LL << 61;
  const static auto e = INF;
  static LL apply(pll &f, LL v, LL w) {return f.X*v + f.Y;};
  static LL mergev(LL a, LL b) {return min(a, b);};
  static pll mergef(pll &f, pll &g) {return pll(f.X*g.X, f.X*g.Y+f.Y);};
};

// assign MOD := INF if raw values wanted
struct SumOp {
  const static auto e = 0LL;
  static LL apply(pll &f, LL v, LL w) {return (f.X*v + f.Y*w)%MOD;};
  static LL mergev(LL a, LL b) {
    LL ret = a+b; 
    while (ret >= MOD) ret -= MOD;
    return ret;
  };
  static pll mergef(pll &f, pll &g) {
    return pll((f.X*g.X)%MOD, (f.X*g.Y+f.Y)%MOD);
  };
};

template <class OP>
struct LazySeg {
  int size;
  vector<char> has_lazy;
  vector<LL> seg;
  vector<LL> width;
  vector<pll> lazy;

  // min

  // sum(mod -> INF)

  LazySeg() {}
  LazySeg(vector<LL> A) {
    Init(A);
  }

  void Init(vector<LL> A) {
    int n = A.size();
    size = 1;
    while (size < n) size *= 2;

    seg.resize(size);
    seg.insert(seg.end(), A.begin(), A.end());
    seg.resize(size*2);
    lazy.resize(size*2);
    has_lazy.resize(size*2);
    width.resize(size*2, 1);
    rrep(i, size) {
      seg[i] = OP::mergev(seg[i*2], seg[i*2+1]);
      width[i] = width[i*2] + width[i*2+1]; 
    }
  }

  void LazyPropagate(int k) {
    if (has_lazy[k]) {
      seg[k] = OP::apply(lazy[k], seg[k], width[k]);
      if (k < size) {
        rep(i, 2) {
          if (has_lazy[k*2+i]) {
            lazy[k*2+i] = OP::mergef(lazy[k], lazy[k*2+i]);
          } else {
            lazy[k*2+i] = lazy[k];
          }
          has_lazy[k*2+i] = true;
        }
      }
      has_lazy[k] = false;
    }
  }

  void Apply(int wishl, int wishr, int k, int watchl, int watchr, LL a, LL b) {
    if (wishr <= watchl || watchr <= wishl) {
      LazyPropagate(k);
      return;
    }

    if (wishl <= watchl && watchr <= wishr) {
      pll p(a, b);
      if (has_lazy[k]) {
        lazy[k] = OP::mergef(p, lazy[k]);
      } else {
        lazy[k] = p;
      }
      has_lazy[k] = true;
      LazyPropagate(k);
      return;
    }

    LazyPropagate(k);
    int mid = (watchl+watchr)/2;
    Apply(wishl, wishr, k*2, watchl, mid, a, b);
    Apply(wishl, wishr, k*2+1, mid, watchr, a, b);
    seg[k] = OP::mergev(seg[k*2], seg[k*2+1]);
  }

  void Apply(int wishl, int wishr, LL a, LL b) {
    return Apply(wishl, wishr, 1, 0, size, a, b);
  }

  LL Get(int wishl, int wishr, int k, int watchl, int watchr) {
    LL lval, rval;

    if (wishr <= watchl || watchr <= wishl) return OP::e;

    if (wishl <= watchl && watchr <= wishr) {
      LazyPropagate(k);
      return seg[k];
    }

    LazyPropagate(k);
    int mid = (watchl+watchr)/2;
    lval = Get(wishl, wishr, k*2, watchl, mid);
    rval = Get(wishl, wishr, k*2+1, mid, watchr);
    return OP::mergev(lval, rval);
  }

  LL Get(int wishl, int wishr) {
    return Get(wishl, wishr, 1, 0, size);
  }
};

typedef LazySeg<MaxOp> MaxSeg;
typedef LazySeg<MinOp> MinSeg;
typedef LazySeg<SumOp> SumSeg;

int main() {
  scanf("%d", &N);
  reps(i, 1, N+1) {
    scanf("%d", &bs[i]);
  }

  scanf("%d", &Q);

  vector<pii> segs;
  rep(i, Q) {
    int l, r;
    scanf("%d%d", &l, &r);
    ++r;
    segs.eb(pii(l, r));
  }
  sort(all(segs), greater<pii>());

  // dp[i][j] := we've processed [1, i).  should fill with 1s [*, j)
  MinSeg seg(vector<LL>(N+20, MinOp::INF/2));
  seg.Apply(0, 1, 0, 0);
  reps(i, 1, N+1) {
    // dp[i+1][k] <- dp[i][*]
    //cout << "i: " << i << endl;
    while (1) {
      auto s = segs.back();
      if (s.X != i) break;
      segs.pop_back();

      //cout << "process " << s.X << ", " << s.Y << endl;
      int r = s.Y;
      LL v = seg.Get(0, r+1);
      seg.Apply(r, r+1, 0, v);
    }

    /*cout << "seg: ";
    rep(j, N+2) {
      auto v = seg.Get(j, j+1);
      if (v < INF/2) cout << v << " ";
      else cout << "INF" << " ";
    }cout << endl;*/

    LL x = seg.Get(0, 1);
    LL y = seg.Get(i+1, i+2);
    seg.Apply(0, 1, 0, min(x+bs[i], y+!bs[i]));
    if (!bs[i]) {
      seg.Apply(i+2, N+3, 1, 1);
    }
    seg.Apply(i+1, i+2, 0, MinOp::INF/2);

    /*cout << "seg: ";
    rep(j, N+2) {
      auto v = seg.Get(j, j+1);
      if (v < INF/2) cout << v << " ";
      else cout << "INF" << " ";
    }cout << endl;*/
  }
  //assert(segs.empty());
  printf("%lld\n", seg.Get(0, N+3));
}


Measured memory_bytes: 22636