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


#include "boost/multiprecision/cpp_int.hpp"
#include "boost/multiprecision/cpp_dec_float.hpp"
namespace mp = boost::multiprecision;
typedef mp::cpp_int LL;
typedef mp::number<mp::cpp_dec_float<1024>> DD;// 仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする)

 
typedef long double dd;
//#define i_7 (ll)(1E9+7)
#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define rrep(i,r,l) for(ll i=r;i>=l;i--)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define endl "\n"
#define SORT(v) sort(v.begin(),v.end())
#define ERASE(v) v.erase(unique(v.begin(),v.end()),v.end())
#define POSL(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define POSU(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
template<class T,class S>
inline bool chmax(T &a, S b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}
template<class T,class S>
inline bool chmin(T &a, S b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

void mod_print(ll k){
    ll P=1000;
    rep(y,1,P){
        ll x=mod(y*k);
        if(x+P>=i_7){
            x-=i_7;
        }
        if(abs(x)<=P){
            cout<<x<<"/"<<y<<endl;
            return;
        }
    }
    cout<<"nun"<<endl;
}
#define all(c) c.begin(),c.end()
//////////////////////////


ll po(ll i,ll p){
    if(p==0)return 1;
    else{
        i=mod(i);
        if(p==1)return i;
        if(p%2==0)return po(mod(i*i),p/2);
        return mod(i*po(i,p-1));
    }
}
ll bunbo(ll n){
    return po(n,i_5);
}
string rev(string t){
    string s;
    rep(i,0,t.size()-1){
        if(t[i]=='1')s+='0';
        else s+='1';
    }
    return s;
}

int main(){fastio
    ll N=200005;
    ll n;cin>>n;
    string s;cin>>s;
    
    bool flag[n+1];memset(flag,false,sizeof(flag));
    for(ll i=1;i*i<=n;i++){
        if(n%i!=0)continue;
        ll j=n/i;
        if(i%2==1){
            flag[j]=true;
        }
        if(j%2==1){
            flag[i]=true;
        }
    }
    
    ll cnt[n+1];memset(cnt,0,sizeof(cnt));
    rep(i,1,n){
        if(flag[i]==false)continue;
        ll sum=0;
        rep(j,0,i-1){
            sum=mod(sum*2);
            if(s[j]=='1')sum++;
        }
        string t;
        string ad=s.substr(0,i);
        string revad=rev(ad);
        rep(cn,0,(n/i)-1){
            if(cn%2==1)t+=revad;
            else t+=ad;
        }
        
        if(s>=t)sum++;
        Add(cnt[i],sum);
        for(ll j=i*2;j<=n;j+=i){
            Add(cnt[j],-cnt[i]);
        }
    }
    
    ll ans=0;
    rep(i,1,n){
        if(flag[i]){
           // cout<<i<<" "<<cnt[i]<<endl;
            Add(ans,2*i*cnt[i]);
        }
    }
    cout<<mod(ans)<<endl;
    return 0;
}


Measured memory_bytes: 3108