#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ld long double
#define lll  __int128
#define dhm std::fixed<<std::setprecision
#define prq priority_queue
using ll = long long;
using ull = unsigned long long;
int T;
template <typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;
const int cd = 6e6+10;
struct pam {
	int len[cd];
	int trie[cd][10];
	int fail[cd];
	int pos;
	int tot = 1;
	int num[cd];
	int cur;
	int lst = 0;
	pam() {
		len[1] = -1;
		fail[0] = 1;
	}
	void init(string s) {
		for(int i = 0 ; i < s.size(); i ++) {
			auto getfail = [&](int x,int i)->int {
				while(i-len[x]-1<0||s[i]!=s[i-len[x]-1])x = fail[x];
				return x;
			};
			pos = getfail(cur,i);
			if(!trie[pos][s[i]-'0']) {
				fail[++tot] = trie[getfail(fail[pos],i)][s[i]-'0'];
				trie[pos][s[i]-'0'] = tot;
				len[tot] = len[pos] + 2;
			}
			cur = trie[pos][s[i]-'0'];
			num[cur]++;
		}
	}
}PAM,dbPAM;
const int mod = 998244353;
void solve() {
	int n;
	std::cin>>n;
	string s;
	std::cin>>s;
	PAM.init(s);
	s+=s;
	dbPAM.init(s);
	for(int i = PAM.tot; i >= 2; i --) {
		PAM.num[PAM.fail[i]] += PAM.num[i];
		//std::cout<<PAM.num[i]<<" "<<PAM.len[i]<<endl;
	}
	ll ans = 0;
	for(int i = dbPAM.tot; i >= 2; i --) {
		dbPAM.num[dbPAM.fail[i]] += dbPAM.num[i];
		dbPAM.num[i] -= PAM.num[i];
		if(dbPAM.len[i]<=n)
			ans = (ans + 1ll*dbPAM.len[i]*dbPAM.num[i]%mod*dbPAM.num[i]%mod)%mod;
	}
	std::cout<<ans<<endl;
}
int main(){
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	T = 1;
	//std::cin>>T;
	while(T --)
		solve();
	return 0;
}