#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
using namespace std;
using u128=__uint128_t;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}

const int maxn=6e6+10;
const int maxalp=10;

int link[maxn],trans[maxn][maxalp],last,cnt,sum[maxn],len[maxn];
string s;

void init(){

    memset(trans,-1,sizeof(trans));
    last=1;
    cnt=2;
    link[0]=0;
    link[1]=0;
    len[0]=-1;
    len[1]=0;

}
void append(int pos,int val,int c){

   // printf("%d %d AFA\n",pos,val);

    int curr=last;
    while(1){
        if(pos-len[curr]-1>=0 && s[pos-len[curr]-1]==s[pos])break;
        curr=link[curr];
    }

    int q=trans[curr][c];
    if(q!=-1){
        last=q;
        sum[q]+=val;
        return;
    }

    q=cnt++;
    len[q]=len[curr]+2;
    last=q;
    sum[q]+=val;
    trans[curr][c]=q;

    curr=link[curr];
    while(1){
        if(pos-len[curr]-1>=0 && s[pos-len[curr]-1]==s[pos])break;
        curr=link[curr];
    }

    if(trans[curr][c]==q)link[q]=1;
    else link[q]=trans[curr][c];

}

vector<int>vect[maxn];
int n,cn;
int main(){

    ///freopen("test.txt","r",stdin);

    ///printf("%d ADA\n",sizeof(vect));

    scanf("%d",&n);
    cin>>s;
    s+=s;
    cn=n;
    n*=2;

    init();

    for(int i=0;i<s.size();i++)
        append(i,i>=cn,s[i]-'0');

    for(int i=1;i<cnt;i++){
       /// printf("%d %d AAA\n",link[i],i);
        vect[link[i]].pb(i);
    }

    int rez=0;
    for(int i=cnt-1;i>=2;i--){
        for(int j=0;j<vect[i].size();j++)sum[i]+=sum[vect[i][j]];
        if(len[i]<=cn)rez=add(rez,mul(len[i],mul(sum[i],sum[i])));
    }

    printf("%d\n",rez);

    return 0;
}