#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int N = 3000010;
int n, ans = 0;
char s[N * 2];
int tot = 1, fail[N * 2], len[N * 2];
int sz[N * 2];
int ch[N * 2][10], cur = 0;

int gfail(int x, int now) {
	for(; now - len[x] - 1 < 1 || s[now - len[x] - 1] != s[now]; x = fail[x]);
	return x;
}
void insert(int now, int c) {
	int pos = gfail(cur, now);
	if(!ch[pos][c]) {
		++tot;
		fail[tot] = ch[gfail(fail[pos], now)][c];
		ch[pos][c] = tot, len[tot] = len[pos] + 2;
	}
	cur = ch[pos][c];
	if(now > n) ++sz[cur];
}
int main() {
	scanf("%d", &n);
	scanf("%s", s + 1);
	for(int i = 1; i <= n; i++) s[i + n] = s[i];
	len[0] = 0, len[1] = -1, fail[1] = 0, fail[0] = 1;
	for(int i = 1; i <= n + n; i++) {
		insert(i, s[i] - '0');
	}
	for(int i = tot; i > 1; i--) {
		if(len[i] <= n) {
			ans = (ans + 1ll * len[i] * sz[i] % mod * sz[i]) % mod;
		}
		sz[fail[i]] = (sz[fail[i]] + sz[i]) % mod;
	}
	cout << ans << "\n";
	return 0;
}