#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }

int next(int x, int n){
    return (x >> 1) | ((~x & 1) << (n - 1));
}

int N;
string X;

lint solve1(){
    vector<int> divisor;
    for(int i = 1; i <= N; i += 2){
        if(N % i == 0){
            divisor.push_back(N / i);
        }
    }
    sort(all(divisor));
    vector<lint> patterns;
    for(int i: divisor){
        lint mul = 0;
        for(int j = 0; j < i; j++){
            mul = (mul * 2 + X[j] - '0') % mod;
        }
        string str_L = X.substr(0, i);
        string str_L_rev;
        str_L_rev.resize(str_L.size());
        for(int j = 0; j < str_L_rev.size(); j++){
            str_L_rev[j] = '0' + '1' - str_L[j];
        }
        for(int j = i; j < N; j += i){
            string str_R = X.substr(j, i);
            if((j / i) % 2 == 0){
                if(str_L > str_R){
                    goto pass;
                }else if(str_L < str_R){
                    mul = (mul + 1) % mod;
                    goto pass;
                }
            }else{
                if(str_L_rev > str_R){
                    goto pass;
                }else if(str_L_rev < str_R){
                    mul = (mul + 1) % mod;
                    goto pass;
                }
            }
        }
        mul = (mul + 1) % mod;
    pass:
        patterns.push_back(mul);
    }
    for(int i = 0; i < divisor.size(); i++){
        for(int j = 0; j < i; j++){
            if(divisor[i] % divisor[j] == 0){
                patterns[i] += mod - patterns[j];
            }
        }
        patterns[i] %= mod;
    }
    lint ans = 0;
    for(int i = 0; i < divisor.size(); i++){
        //cout << divisor[i] << " " << patterns[i] << endl;
        ans += divisor[i] * patterns[i] * 2;
        ans %= mod;
    }
    return ans;
}

lint solve2(){
    int num = 0;
    for(int i = 0; i < N; i++){
        num = num * 2 + X[i] - '0';
    }
    lint sum = 0;
    for(int i = 0; i <= num; i++){
        int j = next(i, N), ans = 1;
        while(i != j){
            j = next(j, N);
            ans++;
            //cout << j << endl;
        }
        sum += ans;
    }
    return sum;
}

int main(){
    cin >> N >> X;
    cout << solve1() << endl;
}



Measured memory_bytes: 952