#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
const int MX=3000300;
const int P=998244353;

int N, cur, siz=1;
string s;
struct node{int ch[10],f,num,len,c;}t[2*MX];
int gf(int id, int p)
{
    while(s[p-t[id].len-1]!=s[p]) id=t[id].f;
    return id;
}
int main()
{
    // freopen("testdata.in","r",stdin);
    cin >> N >> s; s=" "+s+s;
    t[0].f=1; t[1].len=-1;
    for(int i=1;i<=2*N;i++)
    {
        int p=gf(cur,i);
        if(!t[p].ch[s[i]-'0'])
        {
            t[++siz].f=t[gf(t[p].f,i)].ch[s[i]-'0'];
            int &v=t[p].ch[s[i]-'0']=siz;
            t[v].len=t[p].len+2;
            t[v].num=t[t[v].f].num+1;
        }
        cur=t[p].ch[s[i]-'0'];
        if(i>N) t[cur].c++;
    }
    ll ans=0;
    for(int i=siz;i>=0;i--) 
    {
        t[t[i].f].c+=t[i].c;
        if(t[i].len<=N) ans=(ans+ll(t[i].c*t[i].c%P*t[i].len))%P;
    }
    cout << ans << '\n';
    return (0-0);
}