#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...) 0
#endif

template <ll mod>
struct modular {
    ll value;
    modular(ll x = 0) {
        value = x % mod;
        if (value < 0) value += mod;
    }

    modular& operator+=(modular other) {
        if ((value += other.value) >= mod) value -= mod;
        return *this;
    }
    modular& operator-=(modular other) {
        if ((value -= other.value) < 0) value += mod;
        return *this;
    }
    modular& operator*=(modular other) {
        value = value * other.value % mod;
        return *this;
    }
    modular& operator/=(modular other) {
        ll a = 0, b = 1, c = other.value, m = mod;
        while (c != 0) {
            ll t = m / c;
            m -= t * c;
            swap(c, m);
            a -= t * b;
            swap(a, b);
        }
        a %= mod;
        if (a < 0) a += mod;
        value = value * a % mod;
        return *this;
    }
    modular& operator^=(modular other) {
        ll r = 1, x = value, n = other.value;
        while (n > 0) {
            if (n & 1) r = r * x % mod;
            x = x * x % mod;
            n >>= 1;
        }
        value = r;
        return *this;
    }
    modular operator+(modular rhs) {
        return modular(*this) += rhs;
    }
    modular operator-(modular rhs) {
        return modular(*this) -= rhs;
    }
    modular operator*(modular rhs) {
        return modular(*this) *= rhs;
    }
    modular operator/(modular rhs) {
        return modular(*this) /= rhs;
    }
    modular operator^(modular rhs) {
        return modular(*this) ^= rhs;
    }
    bool operator==(modular rhs) {
        return value == rhs.value;
    };
    bool operator!=(modular rhs) {
        return value != rhs.value;
    };
    bool operator<(modular rhs) {
        return value < rhs.value;
    }
};
template <ll mod>
string to_string(modular<mod> x) {
    return to_string(x.value);
}
template <ll mod>
ostream& operator<<(ostream& stream, modular<mod> x) {
    x.value %= mod;
    if (x.value < 0) x.value += mod;
    return stream << x.value;
}
template <ll mod>
istream& operator>>(istream& stream, modular<mod>& x) {
    stream >> x.value;
    x.value %= mod;
    if (x.value < 0) x.value += mod;
    return stream;
}
const ll mod = 998244353;
using mint = modular<mod>;

vector<mint> fac, finv;
inline void cinit(int n) {
    fac.resize(n, 1);
    finv.resize(n, 1);
    for (int i = 2; i < n; i++) {
        fac[i] = fac[i - 1] * i;
        finv[i] = finv[i - 1] / i;
    }
}
inline mint C(int n, int k) {
    if (n < k || k < 0 || n < 0) return 0;
    return fac[n] * finv[k] * finv[n - k];
}
inline mint H(int n, int k) {
    return C(n + k - 1, k);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    string x;
    cin >> n >> x;
    vector<int> d;
    rep(i, 1, 2 * n + 1) {
        if ((2 * n) % i == 0 && ((2 * n) / i) % 2) d.emplace_back(i);
    }
    sort(d.begin(), d.end());
    debug(d);
    string z = x;
    rep(i, 0, n) z.push_back('0' + ((x[i] - '0') ^ 1));
    vector<mint> cnt;
    for (int k : d) {
        mint res = 0, tp = 1;
        for (int i = k / 2 - 1; i >= 0; i--) {
            if (x[i] == '1') res += tp;
            tp *= 2;
        }
        string s = x.substr(0, k / 2);
        rep(i, 0, k / 2) s.push_back('0' + ((x[i] - '0') ^ 1));
        while (s.size() < z.size()) s += s.substr(0, k);
        debug(s);
        if (s <= z) res += 1;
        cnt.emplace_back(res);
    }
    debug(cnt);
    rep(i, 0, cnt.size()) {
        rep(j, i + 1, cnt.size()) {
            if (d[j] % d[i] == 0) {
                cnt[j] -= cnt[i];
            }
        }
    }
    mint ans;
    rep(i, 0, cnt.size()) {
        ans += cnt[i] * d[i];
    }
    cout << ans << endl;
    return 0;
}

Measured memory_bytes: 2024