#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define int ll
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define mp(a, b) make_pair((a), (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";

template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}



void smain();

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}


int get(string s) {
    int n = s.size();
    string tmp = s;
    int ret = 0;
    while (true) {
        ++ret;
        tmp = tmp.substr(1, n - 1) + char(tmp[0] ^ 1);
        if (s == tmp)
            break;
    }
    return ret;
}

const int M = 998244353;
const int N = 2e5 + 10;
int cnt[N];


void insum(int &a, int b) {
    a = (a + b) % M;
}

void smain() {

//    watch(get("110011001100"));
    int n;
    string s;
    cin >> n >> s;
    vi x(n);
    fori (i, n)
        x[i] = s[i] - '0';

    int ans = 0;

    for (int len = 1; len <= n; ++len) {
        if (n % len)
            continue;
        if (((n / len) & 1) == 0)
            continue;
        int eq = 1;
        int B = n / len;
        vvi dp(B, {0, 0});
        for (int i = 0; i < len; ++i) {
            int neq = 0;
            vvi ndp(B, {0, 0});
            for (int item = 0; item < 2; ++item) {
                int cur = item;
                bool les = false;
                int id = -1;
                for (int j = i; j < n; j += len, cur ^= 1) {
                    if (cur < x[j]) {
                        les = true;
                        id = j / len;
                    } else if (cur > x[j]) {
                        id = j / len;
                        les = false;
                    } else {
                        continue;
                    }
                    break;
                }
                if (id == -1) {
                    insum(neq, eq);
                    fori (j, B) {
                        fori (z, 2) {
                            insum(ndp[j][z], dp[j][z]);
                        }
                    }
                } else {
                    int toz = les ? 0 : 1;
                    insum(ndp[id][toz], eq);
                    fori (j, B) {
                        fori (z, 2) {
                            if (id < j) {
                                insum(ndp[id][toz], dp[j][z]);
                            } else {
                                insum(ndp[j][z], dp[j][z]);
                            }
                        }
                    }
                }
            }
            eq = neq;
            dp = ndp;
        }

        fori (j, B) {
            insum(cnt[len], dp[j][0]);
        }
        insum(cnt[len], eq);
        for (int j = 2; j * len <= n; ++j) {
            insum(cnt[j * len], M - cnt[len]);
        }
        insum(ans, 2LL * cnt[len] * len % M);
    }
    cout << ans;
}

Measured memory_bytes: 23956