Problem: On the 228-th international Uzhlyandian Wars strategic game tournament teams from each country are called. The teams should consist of 5 participants.

The team of Uzhlyandia will consist of soldiers, because there are no gamers.

Masha is a new minister of defense and gaming. The prime duty of the minister is to calculate the efficiency of the Uzhlandian army. The army consists of n soldiers standing in a row, enumerated from 1 to n. For each soldier we know his skill in Uzhlyandian Wars: the i-th soldier's skill is ai.

It was decided that the team will consist of three players and two assistants. The skills of players should be same, and the assistants' skills should not be greater than the players' skill. Moreover, it is important for Masha that one of the assistants should stand in the row to the left of the players, and the other one should stand in the row to the right of the players. Formally, a team is five soldiers with indexes i, j, k, l, p, such that 1 ≤ i < j < k < l < p ≤ n and ai ≤ aj = ak = al ≥ ap. 

The efficiency of the army is the number of different teams Masha can choose. Two teams are considered different if there is such i such that the i-th soldier is a member of one team, but not a member of the other team.

Initially, all players are able to be players. For some reasons, sometimes some soldiers become unable to be players. Sometimes some soldiers, that were unable to be players, become able to be players. At any time any soldier is able to be an assistant. Masha wants to control the efficiency of the army, so she asked you to tell her the number of different possible teams modulo 1000000007 (109 + 7) after each change. 

Input

The first line contains single integer n (1 ≤ n ≤ 105) — the number of soldiers in Uzhlyandia.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109) — the soldiers' skills.

The third line contains single integer m (1 ≤ m ≤ 105) — the number of changes.

The next m lines contain the changes, each change is described with two integers t and x (1 ≤ t ≤ 2, 1 ≤ x ≤ n) on a separate line. If t = 1, then the x-th soldier is unable to be a player after this change. If t = 2, then the x-th soldier is able to be a player after this change. 

It is guaranteed that before each query of the first type the soldier is able to be a player, and before each query of the second type the soldier is unable to be a player.

Output

Print m integers — the number of distinct teams after each change.

Print the answers modulo 1000000007 (109 + 7). 

Examples

Input

6
1 1 1 1 1 1
2
1 3
2 3


Output

1
6


Input

8
3 4 4 2 4 5 4 1
3
1 5
2 5
1 2


Output

1
6
2

Note

In the first example, after the first change the only team consists of soldiers [1, 2, 4, 5, 6]. After the second change any five soldiers can form a team.

In the first example after the first change the only team is soldiers [1, 2, 3, 7, 8]. After the second change the possible teams are: [1, 2, 3, 5, 7], [1, 2, 3, 5, 8], [1, 2, 3, 7, 8], [1, 2, 5, 7, 8], [1, 3, 5, 7, 8], [2, 3, 5, 7, 8]. After the third change the possible teams are: [1, 3, 5, 7, 8], [2, 3, 5, 7, 8].

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
int n;
pair<int, int> inp[N];
int maxval;
int arr[N];
int q;
int t, x;
int presum[N];
int sufsum[N];
int bit[N];
struct data {
  int ans;
  int lft;
  int rgt;
  int pre;
  int suf;
  int cnt;
  data() {
    ans = 0;
    lft = 0;
    rgt = 0;
    pre = 0;
    suf = 0;
    cnt = 0;
  }
  data(int i) {
    ans = 0;
    lft = 0;
    rgt = 0;
    pre = presum[i];
    suf = sufsum[i];
    cnt = 1;
  }
  inline void combine(const data &left, const data &right) {
    ans = (1LL * left.lft * right.suf + 1LL * right.rgt * left.pre + left.ans +
           0LL + right.ans) %
          mod;
    lft = (left.lft + 1LL * left.pre * right.cnt + right.lft) % mod;
    rgt = (left.rgt + 1LL * left.cnt * right.suf + right.rgt) % mod;
    pre = left.pre + right.pre;
    pre -= (pre >= mod) * mod;
    suf = left.suf + right.suf;
    suf -= (suf >= mod) * mod;
    cnt = left.cnt + right.cnt;
  }
};
void compress() {
  sort(inp + 1, inp + 1 + n);
  maxval = 0;
  inp[0].first = inp[1].first - 1;
  for (int i = 1; i <= n; ++i) {
    maxval += inp[i - 1].first != inp[i].first;
    arr[inp[i].second] = maxval;
  }
}
int query(int idx) {
  int res = 0;
  while (idx) {
    res += bit[idx];
    idx -= idx & -idx;
  }
  return res;
}
void update(int idx) {
  while (idx <= n) {
    ++bit[idx];
    idx += idx & -idx;
  }
}
void precalc() {
  memset(bit, 0, sizeof(bit));
  for (int i = 1; i <= n; ++i) {
    presum[i] = query(arr[i]);
    update(arr[i]);
  }
  memset(bit, 0, sizeof(bit));
  for (int i = n; i >= 1; --i) {
    sufsum[i] = query(arr[i]);
    update(arr[i]);
  }
}
vector<int> v[N];
vector<data> segtree[N];
int lookup[N];
int answer;
void build(int idx, int l, int r, int node) {
  if (l == r) {
    segtree[idx][node] = data(v[idx][l - 1]);
  } else {
    int mid = l + r >> 1;
    build(idx, l, mid, node + node);
    build(idx, mid + 1, r, node + node + 1);
    segtree[idx][node].combine(segtree[idx][node + node],
                               segtree[idx][node + node + 1]);
  }
}
void build(int idx) {
  int n = v[idx].size();
  segtree[idx].resize(n * 4);
  build(idx, 1, n, 1);
  answer += segtree[idx][1].ans;
  answer -= (answer >= mod) * mod;
}
void build() {
  for (int i = 1; i <= n; ++i) {
    v[arr[i]].emplace_back(i);
    lookup[i] = v[arr[i]].size();
  }
  for (int i = 1; i <= maxval; ++i) {
    build(i);
  }
}
void update(int val, int l, int r, int node, int idx) {
  if (l == r) {
    if (t == 1) {
      segtree[val][node] = data();
    } else {
      segtree[val][node] = data(x);
    }
  } else {
    int mid = l + r >> 1;
    if (idx <= mid) {
      update(val, l, mid, node + node, idx);
    } else {
      update(val, mid + 1, r, node + node + 1, idx);
    }
    segtree[val][node].combine(segtree[val][node + node],
                               segtree[val][node + node + 1]);
  }
}
void update(int t, int x) {
  int val = arr[x];
  int idx = lookup[x];
  answer -= segtree[val][1].ans;
  answer += (answer < 0) * mod;
  update(val, 1, v[val].size(), 1, idx);
  answer += segtree[val][1].ans;
  answer -= (answer >= mod) * mod;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &inp[i].first);
    inp[i].second = i;
  }
  compress();
  precalc();
  build();
  scanf("%d", &q);
  while (q--) {
    scanf("%d %d", &t, &x);
    update(t, x);
    printf("%d\n", answer);
  }
}