#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define MOD (long long int)(998244353)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()

const int N = (int)3e5;

ll mpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
  else return mpow(a,b-1) * a % MOD;
}
ll lpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = lpow(a,b/2); return memo*memo;}
  else return lpow(a,b-1) * a;
}
ll gcd(ll a, ll b){
  if(b==0) return a;
  else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
  if(kaijo_memo.size() > n) return kaijo_memo[n];
  if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
  while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
  return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n){
  if(gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
  if(gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
  while(gyaku_kaijo_memo.size() <= n) gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size()-1] * mpow(gyaku_kaijo_memo.size(), MOD-2) % MOD);
  return gyaku_kaijo_memo[n];
}

ll nCr(ll n, ll r){
  if(n == r) return 1;//0個の丸と-1個の棒みたいな時に時に効く？不安.
  if(n < r || r < 0) return 0;
  ll ret = 1;
  ret *= kaijo(n); ret %= MOD;
  ret *= gyaku_kaijo(r); ret %= MOD;
  ret *= gyaku_kaijo(n-r); ret %= MOD;
  return ret;
}


int main(void){
  ll n;cin>>n;
  string x;cin>>x;
  vector<ll> yakusu;
  reps(i,sqrt(n)+0.0001){//不安
    if(n%i == 0){
      if(n/i >= 3 && n/i%2 == 1){
        yakusu.push_back(i);
      }
      if(i >= 3 && i%2 == 1 && i != n/i){
        yakusu.push_back(n/i);
      }
    }

  }
  sort(all(yakusu));
  reverse(all(yakusu));

  ll ans = 0;
  rep(i,n){
    ans *= 2;
    if(x[i] == '1'){
      ans++;
    }
    ans %= MOD;
  }
  ans++;
  ans *= 2*n;
  ans %= MOD;
  cerr<<ans<<endl;

  vector<pair<ll,ll>> keisu;
  rep(i,yakusu.size()){
    ll yaku = yakusu[i];
    ll sum = 0;
    rep(j,keisu.size()){
      if(keisu[j].first%yaku != 0) continue;
      if(keisu[j].first/yaku >= 3 && keisu[j].first/yaku%2 == 1){
          sum += keisu[j].second;
          sum %= MOD;
          //break;
      }
    

    }
    //cout<<yaku<<" "<<n<<" "<<sum-MOD<<endl;
    keisu.push_back({yaku, (2*yaku - 2*n - sum + MOD*10) % MOD});
  }

  rep(i,keisu.size()){
    ll memo = 0;
    rep(j,keisu[i].first){
      memo *= 2;
      if(x[j] == '1'){
        memo++;
      }
      memo %= MOD;
    }
    bool ok = true;
    rep(si, n){
      if(si < keisu[i].first) continue;
      ll sizeA = keisu[i].first;
      if(si/sizeA%2 == 0){//順の場合
        if(x[si%sizeA] == '1' && x[si] == '0'){
          ok = false;
          break;
        }
        if(x[si%sizeA] == '0' && x[si] == '1'){
          break;
        }
      }else{
        if(x[si%sizeA] == '0' && x[si] == '0'){
          ok = false;
          break;
        }
        if(x[si%sizeA] == '1' && x[si] == '1'){
          break;
        }
      }
    }
    if(ok){
      memo++;
    }
    //cout<<keisu[i].first<<" "<<(memo>10000?memo - MOD:memo)<<" "<<(keisu[i].second-MOD)<<" "<<(memo*keisu[i].second%MOD - MOD)%MOD<<endl;
    ans += memo * keisu[i].second;
    ans %= MOD;
  }
  /*rep(i,keisu.size()){
    cout<<keisu[i].first<<" "<<keisu[i].second<<endl;
  }*/
  cout<<ans<<endl;
  return 0;
}


Measured memory_bytes: 640