Problem: Fedya has a string S, initially empty, and an array W, also initially empty.

There are n queries to process, one at a time. Query i consists of a lowercase English letter c_i and a nonnegative integer w_i. First, c_i must be appended to S, and w_i must be appended to W. The answer to the query is the sum of suspiciousnesses for all subsegments of W [L, \ R], (1 ≤ L ≤ R ≤ i).

We define the suspiciousness of a subsegment as follows: if the substring of S corresponding to this subsegment (that is, a string of consecutive characters from L-th to R-th, inclusive) matches the prefix of S of the same length (that is, a substring corresponding to the subsegment [1, \ R - L + 1]), then its suspiciousness is equal to the minimum in the array W on the [L, \ R] subsegment. Otherwise, in case the substring does not match the corresponding prefix, the suspiciousness is 0.

Help Fedya answer all the queries before the orderlies come for him!

Input

The first line contains an integer n (1 ≤ n ≤ 600 000) — the number of queries.

The i-th of the following n lines contains the query i: a lowercase letter of the Latin alphabet c_i and an integer w_i (0 ≤ w_i ≤ 2^{30} - 1).

All queries are given in an encrypted form. Let ans be the answer to the previous query (for the first query we set this value equal to 0). Then, in order to get the real query, you need to do the following: perform a cyclic shift of c_i in the alphabet forward by ans, and set w_i equal to w_i ⊕ (ans \ \& \ MASK), where ⊕ is the bitwise exclusive "or", \& is the bitwise "and", and MASK = 2^{30} - 1.

Output

Print n lines, i-th line should contain a single integer — the answer to the i-th query.

Examples

Input


7
a 1
a 0
y 3
y 5
v 4
u 6
r 8


Output


1
2
4
5
7
9
12


Input


4
a 2
y 2
z 0
y 2


Output


2
2
2
2


Input


5
a 7
u 5
t 3
s 10
s 11


Output


7
9
11
12
13

Note

For convenience, we will call "suspicious" those subsegments for which the corresponding lines are prefixes of S, that is, those whose suspiciousness may not be zero.

As a result of decryption in the first example, after all requests, the string S is equal to "abacaba", and all w_i = 1, that is, the suspiciousness of all suspicious sub-segments is simply equal to 1. Let's see how the answer is obtained after each request:

1. S = "a", the array W has a single subsegment — [1, \ 1], and the corresponding substring is "a", that is, the entire string S, thus it is a prefix of S, and the suspiciousness of the subsegment is 1.

2. S = "ab", suspicious subsegments: [1, \ 1] and [1, \ 2], total 2.

3. S = "aba", suspicious subsegments: [1, \ 1], [1, \ 2], [1, \ 3] and [3, \ 3], total 4.

4. S = "abac", suspicious subsegments: [1, \ 1], [1, \ 2], [1, \ 3], [1, \ 4] and [3, \ 3], total 5.

5. S = "abaca", suspicious subsegments: [1, \ 1], [1, \ 2], [1, \ 3], [1, \ 4] , [1, \ 5], [3, \ 3] and [5, \ 5], total 7.

6. S = "abacab", suspicious subsegments: [1, \ 1], [1, \ 2], [1, \ 3], [1, \ 4] , [1, \ 5], [1, \ 6], [3, \ 3], [5, \ 5] and [5, \ 6], total 9.

7. S = "abacaba", suspicious subsegments: [1, \ 1], [1, \ 2], [1, \ 3], [1, \ 4] , [1, \ 5], [1, \ 6], [1, \ 7], [3, \ 3], [5, \ 5], [5, \ 6], [5, \ 7] and [7, \ 7], total 12.

In the second example, after all requests S = "aaba", W = [2, 0, 2, 0].

1. S = "a", suspicious subsegments: [1, \ 1] (suspiciousness 2), totaling 2.

2. S = "aa", suspicious subsegments: [1, \ 1] (2), [1, \ 2] (0), [2, \ 2] ( 0), totaling 2.

3. S = "aab", suspicious subsegments: [1, \ 1] (2), [1, \ 2] (0), [1, \ 3] ( 0), [2, \ 2] (0), totaling 2.

4. S = "aaba", suspicious subsegments: [1, \ 1] (2), [1, \ 2] (0), [1, \ 3] ( 0), [1, \ 4] (0), [2, \ 2] (0), [4, \ 4] (0), totaling 2.

In the third example, from the condition after all requests S = "abcde", W = [7, 2, 10, 1, 7].

1. S = "a", suspicious subsegments: [1, \ 1] (7), totaling 7.

2. S = "ab", suspicious subsegments: [1, \ 1] (7), [1, \ 2] (2), totaling 9.

3. S = "abc", suspicious subsegments: [1, \ 1] (7), [1, \ 2] (2), [1, \ 3] ( 2), totaling 11.

4. S = "abcd", suspicious subsegments: [1, \ 1] (7), [1, \ 2] (2), [1, \ 3] ( 2), [1, \ 4] (1), totaling 12.

5. S = "abcde", suspicious subsegments: [1, \ 1] (7), [1, \ 2] (2), [1, \ 3] ( 2), [1, \ 4] (1), [1, \ 5] (1), totaling 13.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <typename T>
struct fenwick_tree {
  int tree_n = 0;
  T tree_sum = 0;
  vector<T> tree;
  fenwick_tree(int n = -1) {
    if (n >= 0) init(n);
  }
  void init(int n) {
    tree_n = n;
    tree_sum = 0;
    tree.assign(tree_n + 1, 0);
  }
  template <typename T_array>
  void build(const T_array &initial) {
    assert((int)initial.size() == tree_n);
    tree_sum = 0;
    for (int i = 1; i <= tree_n; i++) {
      tree[i] = initial[i - 1];
      tree_sum += initial[i - 1];
      for (int k = (i & -i) >> 1; k > 0; k >>= 1) tree[i] += tree[i - k];
    }
  }
  void update(int index, const T &change) {
    assert(0 <= index && index < tree_n);
    tree_sum += change;
    for (int i = index + 1; i <= tree_n; i += i & -i) tree[i] += change;
  }
  T query(int count) const {
    assert(count <= tree_n);
    T sum = 0;
    for (int i = count; i > 0; i -= i & -i) sum += tree[i];
    return sum;
  }
  T query_suffix(int start) const { return tree_sum - query(start); }
  T query(int a, int b) const { return query(b) - query(a); }
  T get(int a) const {
    assert(0 <= a && a < tree_n);
    int above = a + 1;
    T sum = tree[above];
    above -= above & -above;
    while (a != above) {
      sum -= tree[a];
      a -= a & -a;
    }
    return sum;
  }
  int find_last_prefix(T sum) const {
    if (sum < 0) return -1;
    int prefix = 0;
    for (int k = 31 - __builtin_clz(tree_n); k >= 0; k--)
      if (prefix + (1 << k) <= tree_n && tree[prefix + (1 << k)] <= sum) {
        prefix += 1 << k;
        sum -= tree[prefix];
      }
    return prefix;
  }
};
const int MASK = (1 << 30) - 1;
string S;
vector<pair<int, int>> W_stack;
fenwick_tree<int> suffixes;
long long current = 0;
vector<int> fail = {0};
int kmp_len = 0;
vector<int> link;
int query_stack_value(int index) {
  assert(!W_stack.empty());
  int low = 0, high = W_stack.size() - 1;
  while (low < high) {
    int mid = (low + high + 1) / 2;
    if (W_stack[mid].second <= index)
      low = mid;
    else
      high = mid - 1;
  }
  return W_stack[low].first;
}
void add_to_stack(int index, int w) {
  while (!W_stack.empty() && w <= W_stack.back().first) {
    int value = W_stack.back().first;
    int prev_index = W_stack.back().second;
    current -= (long long)suffixes.query(prev_index, index) * (value - w);
    index = prev_index;
    W_stack.pop_back();
  }
  W_stack.emplace_back(w, index);
}
void add_char(char c) {
  S += c;
  if (S.size() > 1) {
    while (kmp_len > 0 && S[kmp_len] != S.back()) kmp_len = fail[kmp_len];
    if (S[kmp_len] == S.back()) kmp_len++;
  }
  fail.push_back(kmp_len);
  int index = S.size() - 1;
  if (index > 0 && S[index] == S[fail[index]])
    link.push_back(link[fail[index]]);
  else
    link.push_back(fail[index]);
}
void remove_suffixes(int len, char c) {
  while (len > 0) {
    if (len < (int)S.size() && S[len] != c) {
      int remove = S.size() - len;
      current -= query_stack_value(remove);
      suffixes.update(remove, -1);
    }
    if (len < (int)S.size() && S[len] == c)
      len = link[len];
    else
      len = fail[len];
  }
}
int main() {
  int N;
  scanf("%d", &N);
  suffixes.init(N);
  const long long LOW_BASE = 1e12;
  long long ans_high = 0, ans_low = 0;
  long long ans_mask = 0, ans26 = 0;
  for (int i = 0; i < N; i++) {
    char c;
    int w;
    scanf(" %c %d", &c, &w);
    c = 'a' + (c - 'a' + ans26) % 26;
    w ^= ans_mask;
    remove_suffixes(i, c);
    add_char(c);
    add_to_stack(i, w);
    if (c == S[0]) {
      suffixes.update(i, +1);
      current += w;
    }
    ans_low += current % LOW_BASE;
    ans_high += current / LOW_BASE + ans_low / LOW_BASE;
    ans_low %= LOW_BASE;
    ans_mask = (ans_mask + current) & MASK;
    ans26 = (ans26 + current) % 26;
    if (ans_high != 0)
      printf("%lld%012lld\n", ans_high, ans_low);
    else
      printf("%lld\n", ans_low);
  }
}