#include <bits/stdc++.h>
using namespace std;
template <class T>
void _R(T &x) {
  cin >> x;
}
void _R(int &x) { scanf("%d", &x); }
void _R(long long &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U>
void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
template <class T>
void _W(const T &x) {
  cout << x;
}
void _W(const int &x) { printf("%d", x); }
void _W(const long long &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U>
void _W(const pair<T, U> &x) {
  _W(x.first);
  putchar(' ');
  _W(x.second);
}
template <class T>
void _W(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _W(*i++))
    if (i != x.cbegin()) putchar(' ');
}
void W() {}
template <class T, class... U>
void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\n');
  W(tail...);
}
int MOD = 1e9 + 7;
void ADD(long long &x, long long v) {
  x = (x + v) % MOD;
  if (x < 0) x += MOD;
}
long long mypow(long long x, long long y) {
  x %= MOD;
  long long res = 1 % MOD;
  while (y) {
    if (y & 1) res = res * x % MOD;
    y >>= 1;
    x = x * x % MOD;
  }
  return res;
}
const int SIZE = 1 << 21;
pair<int, int> p[SIZE], p2[SIZE];
long long res[SIZE], sl[SIZE], sr[SIZE], num[SIZE], NOW, two[SIZE];
void ins(int L, int R, int id, int pos) {
  int mm = (L + R) / 2;
  if (L == R) {
    if (NOW > 0) {
      num[id] = 1;
      sl[id] = sr[id] = NOW;
    } else {
      num[id] = 0;
      sl[id] = sr[id] = 0;
    }
    res[id] = 0;
    return;
  }
  if (pos <= mm) {
    ins(L, mm, id * 2, pos);
  } else {
    ins(mm + 1, R, id * 2 + 1, pos);
  }
  sl[id] = (sl[id * 2] + sl[id * 2 + 1] * two[num[id * 2]]) % MOD;
  sr[id] = (sr[id * 2 + 1] + sr[id * 2] * two[num[id * 2 + 1]]) % MOD;
  num[id] = num[id * 2] + num[id * 2 + 1];
  res[id] = (res[id * 2] * two[num[id * 2 + 1]] +
             res[id * 2 + 1] * two[num[id * 2]] + sl[id * 2] * sr[id * 2 + 1]) %
            MOD;
}
int rm_pos[SIZE];
int lt[SIZE];
int main() {
  two[0] = 1;
  for (int i = (1); i < (600001); ++i) two[i] = two[i - 1] * 2 % MOD;
  int n;
  R(n);
  for (int i = (1); i <= (n); ++i) {
    R(p[i].first);
    p[i].second = i;
    p2[i - 1] = p[i];
    lt[i] = i;
  }
  int q;
  R(q);
  for (int i = (n + 1); i <= (n + q); ++i) {
    int x;
    R(x, p[i].first);
    rm_pos[i] = lt[x];
    lt[x] = i;
    p[i].second = i;
    p2[i - 1] = p[i];
  }
  sort(p2, p2 + n + q);
  for (int i = (1); i <= (n - 1); ++i) {
    NOW = p[i].first;
    int id = lower_bound(p2, p2 + n + q, p[i]) - p2;
    ins(0, n + q - 1, 1, id);
  }
  long long inv = mypow(two[n], MOD - 2);
  for (int i = (n); i <= (n + q); ++i) {
    NOW = p[i].first;
    int id = lower_bound(p2, p2 + n + q, p[i]) - p2;
    ins(0, n + q - 1, 1, id);
    if (i > n) {
      NOW = -p[rm_pos[i]].first;
      id = lower_bound(p2, p2 + n + q, p[rm_pos[i]]) - p2;
      ins(0, n + q - 1, 1, id);
    }
    W(res[1] * inv % MOD);
  }
  return 0;
}
