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

#define eb emplace_back
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

const int A = 10;
const int N = 6000007;

const int mod = 998244353;

int n, ans = 0;

struct Palindromic_AutoMaton {
    vector<int> str;
    int nxt[N][A], fail[N], len[N];   
    int num[N], last, tot;
    void clear() {
        len[1] = -1; fail[1] = 0;
        len[0] = 0; fail[0] = 1;
        str.clear(); str.eb(-1);
        last = 0; tot = 1;
        memset(nxt[0], 0, sizeof(nxt[0]));
        memset(nxt[1], 0, sizeof(nxt[1]));
    }
    Palindromic_AutoMaton(){clear();}
    int newnode(int _len) {
        len[++tot] = _len;
        fail[tot] = num[tot] = 0; 
        memset(nxt[tot], 0, sizeof(nxt[tot]));
        return tot;
    }
    int get_fail(int u) {
        int strlen = str.size() - 1;
        while (str[strlen - len[u] - 1] != str[strlen]) u = fail[u];
        return u;
    }
    void append(int ch, int w) {
        str.emplace_back(ch);
        int fat = get_fail(last);
        if (!nxt[fat][ch]) {
            int cur = newnode(len[fat] + 2);
            fail[cur] = nxt[get_fail(fail[fat])][ch];
            nxt[fat][ch] = cur; 
        }
        last = nxt[fat][ch];
        num[last] += w;
    }
    void append(string &s, int w) {
        for (auto &ch : s) append(ch - '0', w);
    }
    void get_num() {
        per(u, tot, 2) num[fail[u]] += num[u];
        num[0] = num[1] = 0;
    }
    void calc() {
        rep(u, 2, tot) if (len[u] <= n) {
            int w = 1ll * num[u] * num[u] % mod * len[u] % mod;
            ans = (ans + w) % mod;
        }
    }
} pam;

int main() {
    cin.tie(0);
    ios::sync_with_stdio();
    cin >> n;
    string s; cin >> s;
    pam.append(s, 0);
    pam.append(s, 1);
    pam.get_num();
    pam.calc();
    cout << ans;
    return 0;
}