#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 6e6 + 10, M = 23, mod = 998244353;

int n;

namespace PAM {
	struct Node {
		int len, fail, ch[10];
	}pam[N];

	string s;
	int cnt = 2, last = 1, pos = 0;
	void init() {
		s = "$" + s;
		pam[1].len = -1, pam[2].len = 0, pam[2].fail = 1;
	}

	int up(int p) {
		while(pam[p].len + 2 > n || s[pos - pam[p].len - 1] != s[pos]) {
			p = pam[p].fail;
		}
		return p;
	}

	int fa[N][M], f[N], dep[N];
	void insert(int ch, int id) {
		pos += 1;
		int p = up(last);
		int &q = pam[p].ch[ch];
		if(q == 0) {
			q = ++ cnt;
			pam[q].len = pam[p].len + 2;
			pam[q].fail = (p == 1 ? 2 : pam[up(pam[p].fail)].ch[ch]);
		}
		last = q;

		// cout << "ooo  " << id << ' ' << pam[q].fail << ' ' << q << ' ' << pam[q].len << '\n';
		
		p = q;
		dep[p] = dep[pam[p].fail] + 1;
		fa[p][0] = pam[p].fail;
		for(int i = 1; (1 << i) <= dep[p]; i ++ ) {
			fa[p][i] = fa[fa[p][i - 1]][i - 1];
		}

		if(id - pam[p].len + 1 <= n) {
			f[p] += 1;
			int len = log(dep[p]) / log(2);
			for(int j = len; j >= 0; j -- ) {
				if(id - pam[fa[p][j]].len + (pam[fa[p][j]].len > 0) <= n) {
					p = fa[p][j];
				}
			}
			f[fa[p][0]] -= 1;
		}
	}

	ll get_ans() {
		for(int i = cnt; i >= 1; i -- ) {
			f[pam[i].fail] += f[i];
		}

		ll ans = 0;
		for(int i = 1; i <= cnt; i ++ ) {
			if(pam[i].len > 0 && pam[i].len <= n) {
				ll res = 1ll * f[i] * f[i] % mod * pam[i].len % mod;
				ans = (ans + res) % mod;
			}
		}
		return ans;
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	string s;
	cin >> n >> s;
	s = s + s;

	PAM::s = s;
	PAM::init();
	for(int i = 0; i < s.length(); i ++ ) {
		PAM::insert(PAM::s[i + 1] - '0', i + 1);
	}
	cout << PAM::get_ans() << '\n';
	return 0;
}