#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("-ffloat-store")
using namespace std;
clock_t time_p = clock();
void aryanc403() {}
const long long int INF = 0xFFFFFFFFFFFFFFFL;
long long int seed;
mt19937 rng(seed = chrono::steady_clock::now().time_since_epoch().count());
inline long long int rnd(long long int l = 0, long long int r = INF) {
  return uniform_int_distribution<long long int>(l, r)(rng);
}
class CMP {
 public:
  bool operator()(pair<long long int, long long int> a,
                  pair<long long int, long long int> b) {
    return !(a.first < b.first || (a.first == b.first && a.second <= b.second));
  }
};
void add(map<long long int, long long int> &m, long long int x,
         long long int cnt = 1) {
  auto jt = m.find(x);
  if (jt == m.end())
    m.insert({x, cnt});
  else
    jt->second += cnt;
}
void del(map<long long int, long long int> &m, long long int x,
         long long int cnt = 1) {
  auto jt = m.find(x);
  if (jt->second <= cnt)
    m.erase(jt);
  else
    jt->second -= cnt;
}
bool cmp(const pair<long long int, long long int> &a,
         const pair<long long int, long long int> &b) {
  return a.first < b.first || (a.first == b.first && a.second < b.second);
}
const long long int mod = 1000000007L;
const long long int N = 600000L + 4;
struct node {
  long long int ans, fw, bw, s;
  node() : ans(0), fw(0), bw(0), s(1){};
};
node merge(const node &l, const node &r) {
  node a;
  a.ans = l.ans * r.s + r.ans * l.s + l.fw * r.bw;
  a.ans %= mod;
  a.fw = l.fw + r.fw * l.s;
  a.fw %= mod;
  a.bw = l.bw * r.s + r.bw;
  a.bw %= mod;
  a.s = l.s * r.s % mod;
  return a;
}
long long int T, n, i, j, k, in, cnt, l, r, u, v, x, y;
long long int m;
string s;
vector<long long int> a;
vector<pair<long long int, long long int> > gt;
vector<bool> pt;
node f[4 * N + 5];
long long int po(long long int a, long long int n) {
  if (n == 0) return 1;
  if (n & 1) return (a * po(a, n - 1)) % mod;
  return po(a * a % mod, n / 2);
}
long long int fnd(pair<long long int, long long int> x) {
  long long int it = lower_bound(begin(gt), end(gt), x) - gt.begin();
  return it;
}
void build(long long int id, long long int l, long long int r) {
  if (l == r) {
    if (pt[l]) {
      f[id].fw = f[id].bw = gt[l].first;
      f[id].s = 2;
    } else {
      f[id].fw = f[id].bw = 0;
      f[id].s = 1;
    }
    return;
  }
  long long int m = (l + r) / 2;
  build(2 * id, l, m);
  build(2 * id + 1, m + 1, r);
  f[id] = merge(f[2 * id], f[2 * id + 1]);
}
void update(long long int id, long long int l, long long int r,
            long long int pos) {
  if (r < pos || pos < l) return;
  if (l == r) {
    if (pt[l]) {
      f[id].fw = f[id].bw = gt[l].first;
      f[id].s = 2;
    } else {
      f[id].fw = f[id].bw = 0;
      f[id].s = 1;
    }
    return;
  }
  long long int m = (l + r) / 2;
  update(2 * id, l, m, pos);
  update(2 * id + 1, m + 1, r, pos);
  f[id] = merge(f[2 * id], f[2 * id + 1]);
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  {
    cin >> n;
    const long long int den = po(po(2, n), mod - 2);
    a.clear();
    a.reserve(n);
    a.push_back(-1);
    gt.push_back({0, 0});
    gt.push_back({INF, 0});
    for (i = (1); i <= (n); ++i) {
      cin >> in;
      a.push_back(in);
      gt.push_back({in, i});
    }
    long long int q;
    cin >> q;
    vector<pair<long long int, long long int> > qur;
    while (q--) {
      cin >> x >> in;
      qur.push_back({x, in});
      gt.push_back({in, x});
    }
    sort(begin(gt), end(gt));
    gt.erase(unique(begin(gt), end(gt)), gt.end());
    ;
    for (auto x : gt) pt.push_back(a[x.second] == x.first);
    ;
    build(1, 1, (long long int)(gt).size() - 1);
    ;
    cout << (f[1].ans * den) % mod << "\n";
    for (auto u : qur) {
      const long long int x = u.first, v = u.second;
      long long int cur = fnd({a[x], x});
      assert(pt[cur] == 1);
      pt[cur] = 0;
      update(1, 1, (long long int)(gt).size() - 1, cur);
      a[x] = v;
      cur = fnd({a[x], x});
      assert(pt[cur] == 0);
      pt[cur] = 1;
      update(1, 1, (long long int)(gt).size() - 1, cur);
      ;
      cout << (f[1].ans * den) % mod << "\n";
    }
  }
  aryanc403();
  return 0;
}
