#include <bits/stdc++.h>
using namespace std;
const long long inf = (1ll << 62) - 1;
long long mod = 1e9 + 7;
const long long N = 1e3 + 5;
const long double pi = 3.14159265358979323846;
long long bPow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) {
      res = (res * a) % mod;
    }
    b >>= 1;
    a = (a * a) % mod;
  }
  return res % mod;
}
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  return gcd(b, a % b);
}
vector<long long> fact(N, 0ll);
void factorial() {
  fact[0] = 1, fact[1] = 1;
  for (long long i = 2; i < N; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
  }
}
long long ncr(long long n, long long r) {
  if (r > n) return 0;
  long long ans = fact[n] % mod;
  ans *= bPow(fact[r], mod - 2) % mod;
  ans %= mod;
  ans *= bPow(fact[n - r], mod - 2) % mod;
  ans %= mod;
  return ans;
}
vector<long long> primes(N, -1);
void sieve() {
  iota(primes.begin(), primes.end(), 0);
  for (long long i = 2; i < N; ++i) {
    if (primes[i] == i) {
      for (long long j = 2 * i; j < N; j += i) {
        if (primes[j] == j) primes[j] = i;
      }
    }
  }
}
long long add(long long a, long long b) { return ((a + b) % mod + mod) % mod; }
long long mul(long long a, long long b) { return ((a * b) % mod + mod) % mod; }
void solve() {
  long long n;
  string s;
  cin >> n >> s;
  vector<long long> a(26);
  for (long long i = 0; i < 26; ++i) {
    cin >> a[i];
  }
  vector<long long> dp1(n + 1, 0), dp2(n + 1, inf);
  dp1[0] = 1, dp2[0] = 0;
  long long maxLen = 0;
  for (long long i = 1; i <= n; ++i) {
    long long minn = inf;
    for (long long j = i - 1; j >= 0; --j) {
      long long c = s[j] - 'a';
      minn = min(minn, a[c]);
      if (i - j > minn) break;
      dp1[i] = add(dp1[i], dp1[j]);
      dp2[i] = min(dp2[i], dp2[j] + 1);
      maxLen = max(maxLen, i - j);
    }
  }
  cout << dp1[n] << "\n" << maxLen << "\n" << dp2[n] << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long tc = 1, test = 1;
  while (tc--) {
    solve();
  }
}
