Problem: Nick likes strings very much, he likes to rotate them, sort them, rearrange characters within a string... Once he wrote a random string of characters a, b, c on a piece of paper and began to perform the following operations: 

  * to take two adjacent characters and replace the second character with the first one, 
  * to take two adjacent characters and replace the first character with the second one 



To understand these actions better, let's take a look at a string «abc». All of the following strings can be obtained by performing one of the described operations on «abc»: «bbc», «abb», «acc». Let's denote the frequency of a character for each of the characters a, b and c as the number of occurrences of this character in the string. For example, for string «abc»: |a| = 1, |b| = 1, |c| = 1, and for string «bbc»: |a| = 0, |b| = 2, |c| = 1. 

While performing the described operations, Nick sometimes got balanced strings. Let's say that a string is balanced, if the frequencies of each character differ by at most 1. That is  - 1 ≤ |a| - |b| ≤ 1,  - 1 ≤ |a| - |c| ≤ 1 и  - 1 ≤ |b| - |c| ≤ 1. 

Would you help Nick find the number of different balanced strings that can be obtained by performing the operations described above, perhaps multiple times, on the given string s. This number should be calculated modulo 51123987.

Input

The first line contains integer n (1 ≤ n ≤ 150) — the length of the given string s. Next line contains the given string s. The initial string can be balanced as well, in this case it should be counted too. The given string s consists only of characters a, b and c.

Output

Output the only number — the number of different balanced strings that can be obtained by performing the described operations, perhaps multiple times, on the given string s, modulo 51123987.

Examples

Input

4
abca


Output

7


Input

4
abbc


Output

3


Input

2
ab


Output

1

Note

In the first sample it is possible to get 51 different strings through the described operations, but only 7 of them are balanced: «abca», «bbca», «bcca», «bcaa», «abcc», «abbc», «aabc». In the second sample: «abbc», «aabc», «abcc». In the third sample there is only one balanced string — «ab» itself.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int mod = 51123987, maxn = 155;
__inline int abss(int a) {
  if (a > 0) return a;
  return -a;
}
char s[200];
int f[maxn][55][55][55], g[maxn][3], n;
int main() {
  scanf("%d%s", &n, s);
  g[n][0] = g[n][1] = g[n][2] = n;
  for (int i = n - 1; i >= 0; i--) {
    g[i][0] = g[i + 1][0];
    g[i][1] = g[i + 1][1];
    g[i][2] = g[i + 1][2];
    g[i][s[i] - 'a'] = i;
  }
  f[0][0][0][0] = 1;
  int m = (n + 2) / 3 + 1, ans = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      for (int k = 0; k < m; k++)
        for (int l = 0; l < m; l++)
          if (f[i][j][k][l]) {
            if (j + k + l == n && abss(j - k) <= 1 && abss(k - l) <= 1 &&
                abss(l - j) <= 1)
              ans = (ans + f[i][j][k][l]) % mod;
            if (g[i][0] != n)
              f[g[i][0]][j + 1][k][l] =
                  (f[g[i][0]][j + 1][k][l] + f[i][j][k][l]) % mod;
            if (g[i][1] != n)
              f[g[i][1]][j][k + 1][l] =
                  (f[g[i][1]][j][k + 1][l] + f[i][j][k][l]) % mod;
            if (g[i][2] != n)
              f[g[i][2]][j][k][l + 1] =
                  (f[g[i][2]][j][k][l + 1] + f[i][j][k][l]) % mod;
          }
  printf("%d\n", ans);
  return 0;
}