#include <bits/stdc++.h>
#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
//const ll MOD = 1000000007;
const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

int main() {
  int n;
  cin >> n;
  string s;
  cin >> s;

  vl power2(max(n + 10, (int)s.size() + 10));
  power2[0] = 1;
  rep (i, power2.size()) {
    power2[i + 1] = power2[i] * 2 % MOD;
  }

  int ma = 0;
  vi gs;
  rep1 (i, n) {
    if (n % i == 0) {
      int gr = n / i;
      if (gr % 2 == 1) {
        gs.push_back(gr);
      }
    }
  }
  sort(all(gs));
  UNIQUE(gs);
  //if (gs.back() != n) gs.push_back(n);
  //DEBUG_VEC(gs);

  vl ans(n + 1);
  vl nums(n + 1);
  rrep (_, gs.size()) {
    int g = gs[_];
    int x = n / g;

    //DEBUG(pii(x, g));
    
    string temp;
    rep (i, x) temp += s[i];

    ll num = 0;
    rep (i, temp.size()) {
      if (temp[temp.size() - 1 - i] == '1') {
        num += power2[i];
      }
    }
    num++;
    num %= MOD;
    
    string gyaku;
    rep (i, x) {
      if (temp[i] == '0') gyaku.push_back('1');
      else gyaku.push_back('0');
    }

    string t = temp;
    while (t.size() < s.size()) {
      t += gyaku;
      t += temp;
    }

    if (t > s) num--;
    nums[x] = num;

    ans[x] = num * 2 * x % MOD;
    rrep (i, gs.size()) {
      int y = n / gs[i];
      if (y == x) break;
      if (x % y == 0) {
        nums[x] -= nums[y];
        ans[x] -= nums[y] * 2 * x;
      }
      ans[x] %= MOD;
    }
  }

  //DEBUG_VEC(nums);
  //DEBUG_VEC(ans);

  ll res = 0;
  rep (i, n + 1) {
    res += ans[i];
    res %= MOD;
  }
  res = (res + MOD) % MOD;
  cout << res << endl;
}

/*
string get_bit(ll x, int n) {
  ll mask = 1LL << (n - 1);
  string res;
  while (mask > 0) {
    if (x & mask) res += '1';
    else res += '0';
    mask >>= 1;
  }
  return res;
}

int main() {
  int n;
  cin >> n;

  DEBUG(n);
  string x;
  //cin >> x;
  vi used(1 << n);
  vii group(1 << n);
  //rep (i, stol(x) + 1) {
  rep (i, 1 << n) {
    if (used[i]) continue;
    //DEBUG(i);
      
    int start = i;
    int now = start;
    used[now] = true;
    group[i].push_back(now);
    do {
      //string bit = get_bit(now);
      //DEBUG(bit);
      if (now % 2 == 0) {
        now = now / 2 + (1 << (n - 1));
      }
      else {
        now = now / 2;
      }
      used[now] = true;
      group[i].push_back(now);
    } while (now != start);
    group[i].pop_back();
  }

  rrep (i, 1 << n) {
    if (group[i].size()) {
      if (group[i].size() == 2*n) continue;
      DEBUG(i);
      string temp = get_bit(i, n);
      DEBUG(temp);
      DEBUG(group[i].size());
      //assert(group[i].size() == (1LL << n) % (2*n));
      //*
      rep (j, group[i].size()) {
        cout << group[i][j] << " ";
      }
      cout << endl;
      //break;
    }
  }
}
//*/
  


Measured memory_bytes: 5828