#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using VVbo = vector<Vbo>;
using VVV = vector<VV>;
using VVVll = vector<VVll>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using Pld = pair<ld, ld>;
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define rep(i, n) rep2(i, 0, n)
#define drep(i, n) drep2(i, n, 0)
#define all(a) (a).begin(), (a).end()
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template<typename T> inline int sz(T &x) { return x.size(); }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<typename T> inline int count_between(vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)
inline int fLog2(const int x) { assert(x > 0); return 31-__builtin_clz(x); } // floor(log2(x))
inline int fLog2(const ll x) { assert(x > 0); return 63-__builtin_clzll(x); }
inline int cLog2(const int x) { assert(x > 0); return (x == 1) ? 0 : 32-__builtin_clz(x-1); } // ceil(log2(x))
inline int cLog2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64-__builtin_clzll(x-1); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
void fail() { puts("-1"); exit(0); }
const int INF  = 1<<30;
const ll INFll = 1ll<<62;
const ld EPS   = 1e-10;
const ld PI    = acos(-1.0);
// const int MOD  = int(1e9)+7;
const int MOD  = 998244353;


template<int MOD> struct ModInt {
  int x;
  ModInt(int _x = 0) : x( (0 <= _x && _x < MOD) ? _x : (_x%MOD+MOD)%MOD ) {}
  constexpr int &value() noexcept { return x; }
  constexpr ModInt operator-() const noexcept { return ModInt(MOD-x); }
  constexpr ModInt operator+(const ModInt y) const noexcept { return ModInt(*this) += y; }
  constexpr ModInt operator-(const ModInt y) const noexcept { return ModInt(*this) -= y; }
  constexpr ModInt operator*(const ModInt y) const noexcept { return ModInt(*this) *= y; }
  constexpr ModInt operator/(const ModInt y) const noexcept { return ModInt(*this) /= y; }
  constexpr ModInt &operator+=(const ModInt y) noexcept { x += y.x; if (x >= MOD) x -= MOD; return *this; }
  constexpr ModInt &operator-=(const ModInt y) noexcept { x -= y.x; if (x < 0) x += MOD; return *this; }
  constexpr ModInt &operator*=(const ModInt y) noexcept { x = ll(x) * y.x % MOD; return *this; }
  constexpr ModInt &operator/=(const ModInt y) {
    int a = y.x, b = MOD, u = 1, v = 0;
    while (b) {
      int t = a / b;
      a -= t * b; swap(a, b);
      u -= t * v; swap(u, v);
    }
    x = ll(x) * u % MOD;
    if (x < 0) x += MOD;
    return *this;
  }
};
using mint = ModInt<MOD>;
using Vm = vector<mint>;
using VVm = vector<Vm>;
using VVVm = vector<VVm>;
// istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }


vector<ll> divisor(ll n) {
  vector<ll> res;
  for (ll i = 1; i*i <= n; ++i) {
    if (n%i != 0) continue;
    res.push_back(i);
    if (i*i != n) res.push_back(n/i);
  }
  sort(res.begin(), res.end());
  return res;
}


mint num(string s) {
  int n = sz(s);
  mint res = 0;
  mint pw = 1;
  drep(i, n) {
    if (s[i] == '1') res += pw;
    pw *= 2;
  }
  return res;
}

string rev(string s) {
  rep(i, sz(s)) s[i] = '0' + ((s[i] - '0')^1);
  return s;
}


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

  Vm cnt(n+1);

  for (auto d : divisor(n)) {
    int m = n / d;
    if (m % 2 == 0) continue;
    string t = s.substr(0, d);
    cnt[d] = num(t);

    bool ok = true;
    rep(i, m) {
      if (i % 2 == 0) {
        if (t < s.substr(d*i, d)) break;
        if (t > s.substr(d*i, d)) { ok = false; break; }
      }
      else {
        if (rev(t) < s.substr(d*i, d)) break;
        if (rev(t) > s.substr(d*i, d)) { ok = false; break; }
      }
    }
    if (ok) cnt[d] += 1;
  }

  rep2(i, 1, n) for (int j = 2*i; j <= n; j += i) {
    if (n % j == 0) cnt[j] -= cnt[i];
  }

  mint ans = 0;
  rep(i, n+1) ans += cnt[i] * (2*i);
  cout << ans << '\n';
  return 0;
}


Measured memory_bytes: 4736