#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
random_device rnd;
mt19937 mt(rnd());
int main() {
  cin.tie(0); cout.tie(0);
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  string S;
  cin >> S;
  vector<bool> can(120, false);
  vector<int> pom(N, 1);
  for(int i = N - 2; i >= 0; i--) {
    pom[i] = pom[i + 1] * 10 % 120;
  }
  int now = 0;
  for(int i = N - 1; i >= 0; i--) {
    now += (S[i] - '0') * pom[i];
    now %= 120;
  }
  for(int epoch = 0; epoch < 37000000; epoch++) {
    int u = mt() % N;
    int v = mt() % N;
    now -= (S[u] - '0') * pom[u];
    now -= (S[v] - '0') * pom[v];
    swap(S[u], S[v]);
    now += (S[u] - '0') * pom[u];
    now += (S[v] - '0') * pom[v];
    now %= 120;
    now = (now + 120) % 120;
    can[now] = true;
  }
  cout << accumulate(can.begin(), can.end(), 0) << '\n';
  return 0;
}