// Created by calabash_boy on 18-6-4.
// BZOJ 3676
// calc max(len(t)*cnt(t)) t为s回文子串，cnt(t)=t出现次数
#include<bits/stdc++.h>
using namespace std;
const int maxn = 6e6+100;
const int mod = 998244353;

struct Palindromic_AutoMaton{
    //basic
    int s[maxn],now;
    int nxt[maxn][10],fail[maxn],l[maxn],last,tot;
    // extension
    int num[maxn];/*节点代表的所有回文串出现次数*/
    bool two,flag[maxn];
    void clear(){
        //1节点：奇数长度root 0节点：偶数长度root
        s[0]=l[1]=-1;
        two=false;
        fail[0] = tot = now =1;
        last = l[0]=0;
        memset(nxt[0],0,sizeof nxt[0]);
        memset(nxt[1],0,sizeof nxt[1]);
        memset(flag,0,sizeof(flag));
    }
    Palindromic_AutoMaton(){clear();}
    int newnode(int ll){
        tot++;
        memset(nxt[tot],0,sizeof nxt[tot]);
        fail[tot]=num[tot]=0;
        flag[tot]=two;
        l[tot]=ll;
        return tot;
    }
    int get_fail(int x){
        while (s[now-l[x]-2]!=s[now-1])x = fail[x];
        return x;
    }
    void add(int ch){
        s[now++] = ch;
        int cur = get_fail(last);
        if(!nxt[cur][ch]){
            int tt = newnode(l[cur]+2);
            fail[tt] = nxt[get_fail(fail[cur])][ch];
            nxt[cur][ch] = tt;
        }
        last = nxt[cur][ch];
        if(flag[last]){
            num[last]++;
        }
    }
    void build(){
        //fail[i]<i，拓扑更新可以单调扫描。
        for (int i=tot;i>=2;i--){
            num[fail[i]]+=num[i];
        }
        num[0]=num[1]=0;
    }
    void init(char* ss){
        while (*ss){
            add(*ss-'0');ss++;
        }
    }
    void init(string str){
        for (int i=0;i<str.size();i++){
            add(str[i]-'0');
        }
    }
    long long query(string s);
}pam;
string s;
long long Palindromic_AutoMaton::query(string s){
    long long ret =0;
    for (int i=2;i<=tot;i++){
        if(l[i]<=s.size()){
            long long temp=1ll*num[i]*num[i]%mod;
            temp=1ll*temp*l[i]%mod;
            ret+=temp;
            ret%=mod;  
            //cout<<ret<<endl;
        }
    }
    return ret;
}

int main(){
    int n;scanf("%d",&n);
    cin>>s;
    pam.init(s);
    //cout<<s<<endl;
    pam.two=true;
    pam.init(s);
    pam.build();
    printf("%lld\n",pam.query(s));
    return 0;
}