#include <bits/stdc++.h>
using namespace std;
const double pi = acos(0.0) * 2.0;
const long double eps = 1e-10;
const int step[8][2] = {{-1, 0}, {0, 1}, {1, 0},  {0, -1},
                        {-1, 1}, {1, 1}, {1, -1}, {-1, -1}};
template <class T>
inline T abs1(T a) {
  return a < 0 ? -a : a;
}
template <typename t, typename t1>
t min1(t a, t1 b) {
  return a < b ? a : b;
}
template <typename t, typename... arg>
t min1(t a, arg... arr) {
  return min1(a, min1(arr...));
}
template <typename t, typename t1>
t max1(t a, t1 b) {
  return a > b ? a : b;
}
template <typename t, typename... arg>
t max1(t a, arg... arr) {
  return max1(a, max1(arr...));
}
inline int jud(double a, double b) {
  if (abs(a) < eps && abs(b) < eps)
    return 0;
  else if (abs1(a - b) / max(abs1(a), abs1(b)) < eps)
    return 0;
  if (a < b) return -1;
  return 1;
}
template <typename t>
inline int jud(t a, t b) {
  if (a < b) return -1;
  if (a == b) return 0;
  return 1;
}
template <typename it, typename t1>
inline int RangeFind(t1 val, it a, int na, bool f_small = 1, bool f_lb = 1) {
  if (na == 0) return 0;
  int be = 0, en = na - 1;
  if (*a <= *(a + na - 1)) {
    if (f_lb == 0)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != 1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != -1)
          en = mid;
        else
          be = mid + 1;
      }
    if (f_small && jud(*(a + be), val) == 1) be--;
    if (!f_small && jud(*(a + be), val) == -1) be++;
  } else {
    if (f_lb)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != -1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != 1)
          en = mid;
        else
          be = mid + 1;
      }
    if (!f_small && jud(*(a + be), val) == -1) be--;
    if (f_small && jud(*(a + be), val) == 1) be++;
  }
  return be;
}
template <class T>
inline T lowb(T num) {
  return num & (-num);
}
inline int bitnum(unsigned int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(unsigned long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitnum(long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitmaxl(unsigned int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(unsigned long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
inline int bitmaxl(long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
long long pow(long long n, long long m, long long mod = 0) {
  if (m < 0) return 0;
  long long ans = 1;
  long long k = n;
  while (m) {
    if (m & 1) {
      ans *= k;
      if (mod) ans %= mod;
    }
    k *= k;
    if (mod) k %= mod;
    m >>= 1;
  }
  return ans;
}
template <class t1, class t2>
inline void add(t1 &a, t2 b, int mod = -1) {
  if (mod == -1) mod = 1000000007;
  a += b;
  while (a >= mod) a -= mod;
  while (a < 0) a += mod;
}
template <class t>
void output1(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) cerr << arr[i] << ' ';
  cerr << endl;
}
template <class t>
void output2(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) output1(arr[i]);
}
const int maxn = 600100;
struct SegmentNode {
  int be, en;
  unsigned long long add, sum, cnt;
};
struct SegmentTree {
  int l;
  SegmentNode tree[maxn * 4];
  inline int GetLeft(int no) { return no << 1; }
  inline int GetRight(int no) { return (no << 1) + 1; }
  inline int GetFa(int no) { return no >> 1; }
  inline SegmentTree() { l = 0; }
  void Build(int no, int l, int r) {
    if (l > r) r = l;
    if (l == r) {
      tree[no].be = tree[no].en = l;
      tree[no].sum = tree[no].cnt = 0;
      tree[no].add = -1;
      return;
    }
    tree[no].be = l;
    tree[no].en = r;
    int mid = (l + r) / 2;
    Build(GetLeft(no), l, mid);
    Build(GetRight(no), mid + 1, r);
    tree[no].add = -1;
    PushUp(no);
  }
  inline void PushUp(int no) {
    tree[no].sum = tree[GetLeft(no)].sum + tree[GetRight(no)].sum;
    tree[no].cnt = tree[GetLeft(no)].cnt + tree[GetRight(no)].cnt;
  }
  inline void PushDown(int no) {
    int le = GetLeft(no), ri = GetRight(no);
    tree[le].add = tree[no].add;
    tree[le].sum = tree[no].add * tree[le].cnt;
    tree[ri].add = tree[no].add;
    tree[ri].sum = tree[no].add * tree[ri].cnt;
    tree[no].add = -1;
  }
  void Upd(int l, int r, int no, unsigned long long ranadd, int cnt) {
    if (l <= tree[no].be && r >= tree[no].en) {
      tree[no].add = ranadd;
      if (cnt != -1) {
        tree[no].cnt = cnt;
      }
      tree[no].sum = ranadd * tree[no].cnt;
      return;
    }
    if (tree[no].add != -1 && tree[no].be != tree[no].en) PushDown(no);
    int mid = (tree[no].be + tree[no].en) >> 1;
    if (r >= tree[no].be && l <= mid) Upd(l, r, GetLeft(no), ranadd, cnt);
    if (r >= mid + 1 && l <= tree[no].en) Upd(l, r, GetRight(no), ranadd, cnt);
    PushUp(no);
  }
} sgt;
int kmp[maxn], nxt_have[maxn];
pair<int, int> st[maxn];
int lst;
char orig[maxn];
int val[maxn];
vector<int> fails[maxn];
int n;
void ExtendKMP(int loc) {
  if (loc == 0)
    kmp[loc] = -1;
  else
    kmp[loc] = kmp[loc - 1] + 1;
  while (kmp[loc] > 0 && orig[kmp[loc]] != orig[loc]) {
    fails[loc].push_back(kmp[loc]);
    kmp[loc] = kmp[kmp[loc] - 1] + 1;
  }
  if (kmp[loc] == -1 || orig[kmp[loc]] != orig[loc]) {
    kmp[loc] = -1;
    nxt_have[loc] = -1;
  } else {
    if (fails[kmp[loc]].size()) {
      nxt_have[loc] = kmp[loc];
    } else {
      nxt_have[loc] = nxt_have[kmp[loc]];
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  scanf("%d", &n);
  sgt.Build(1, 0, n - 1);
  unsigned long long sum1 = 0, sum2 = 0, r26 = 0, r130 = 0;
  for (int i = 0; i < n; i++) {
    scanf("%s%d", orig + i, val + i);
    orig[i] -= 'a';
    orig[i] = (orig[i] + r26) % 26;
    val[i] = val[i] ^ (r130 & ((1ll << 30) - 1));
    ExtendKMP(i);
    st[lst] = make_pair(val[i], i);
    while (lst && st[lst - 1].first > val[i]) {
      lst--;
    }
    sgt.Upd(st[lst].second, i, 1, val[i], -1);
    if (orig[i] == orig[0]) {
      sgt.Upd(i, i, 1, val[i], 1);
    }
    for (int loc = i; loc > 0; loc = nxt_have[loc]) {
      for (auto it : fails[loc]) {
        int rloc = i - it;
        sgt.Upd(rloc, rloc, 1, 0, 0);
      }
    }
    st[lst] = make_pair(val[i], st[lst].second);
    lst++;
    sum1 += sgt.tree[1].sum;
    if (sum1 > 1000000000000ll) {
      sum2 += sum1 / 1000000000000ll;
      sum1 %= 1000000000000ll;
    }
    r26 += sgt.tree[1].sum;
    r26 %= 26;
    r130 += sgt.tree[1].sum;
    r130 &= (1ll << 30) - 1;
    if (sum2) {
      printf("%I64u%012I64u\n", sum2, sum1);
    } else {
      printf("%I64u\n", sum1);
    }
  }
  return 0;
}
