#define DEBUG 0
/**
 * File    : C.cpp
 * Author  : Kazune Takahashi
 * Created : 11/1/2019, 5:40:03 PM
 * Powered by Visual Studio Code
 */
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <complex>
#include <tuple>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <functional>
#include <random>
#include <chrono>
#include <cctype>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
template <typename T>
void ch_max(T &left, T right)
{
  if (left < right)
  {
    left = right;
  }
}
template <typename T>
void ch_min(T &left, T right)
{
  if (left > right)
  {
    left = right;
  }
}
using ll = long long;
class mint
{
public:
  static ll MOD;
  ll x;
  mint() : x(0) {}
  mint(ll x) : x(x % MOD) {}
  mint operator-() const { return x ? MOD - x : 0; }
  mint &operator+=(const mint &a)
  {
    if ((x += a.x) >= MOD)
    {
      x -= MOD;
    }
    return *this;
  }
  mint &operator-=(const mint &a) { return *this += -a; }
  mint &operator*=(const mint &a)
  {
    (x *= a.x) %= MOD;
    return *this;
  }
  mint &operator/=(const mint &a)
  {
    mint b{a};
    return *this *= b.power(MOD - 2);
  }
  mint operator+(const mint &a) const { return mint(*this) += a; }
  mint operator-(const mint &a) const { return mint(*this) -= a; }
  mint operator*(const mint &a) const { return mint(*this) *= a; }
  mint operator/(const mint &a) const { return mint(*this) /= a; }
  bool operator<(const mint &a) const { return x < a.x; }
  bool operator==(const mint &a) const { return x == a.x; }
  const mint power(ll N)
  {
    if (N == 0)
    {
      return 1;
    }
    else if (N % 2 == 1)
    {
      return *this * power(N - 1);
    }
    else
    {
      mint half = power(N / 2);
      return half * half;
    }
  }
};
ll mint::MOD = 998244353;
istream &operator>>(istream &stream, mint &a) { return stream >> a.x; }
ostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }
class combination
{
public:
  vector<mint> inv, fact, factinv;
  static int MAX_SIZE;
  combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)
  {
    inv[1] = 1;
    for (auto i = 2; i < MAX_SIZE; i++)
    {
      inv[i] = (-inv[mint::MOD % i]) * (mint::MOD / i);
    }
    fact[0] = factinv[0] = 1;
    for (auto i = 1; i < MAX_SIZE; i++)
    {
      fact[i] = mint(i) * fact[i - 1];
      factinv[i] = inv[i] * factinv[i - 1];
    }
  }
  mint operator()(int n, int k)
  {
    if (n >= 0 && k >= 0 && n - k >= 0)
    {
      return fact[n] * factinv[k] * factinv[n - k];
    }
    return 0;
  }
};
int combination::MAX_SIZE = 3000010;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
// constexpr double epsilon = 1e-10;
// constexpr ll infty = 1000000000000000LL;
// constexpr int dx[4] = {1, 0, -1, 0};
// constexpr int dy[4] = {0, 1, 0, -1};
void Yes()
{
  cout << "Yes" << endl;
  exit(0);
}
void No()
{
  cout << "No" << endl;
  exit(0);
}

string bar(string const &S)
{
  stringstream SS;
  for (auto x : S)
  {
    if (x == '0')
    {
      SS << '1';
    }
    else
    {
      SS << '0';
    }
  }
  return SS.str();
}

mint binary(string S)
{
  mint base{1};
  mint ans{0};
  reverse(S.begin(), S.end());
  for (auto x : S)
  {
    ans += base * (x - '0');
    base *= 2;
  }
  return ans;
}

string expand(string S, int K)
{
  assert(K % 2 == 1);
  string T{bar(S)};
  T += S;
  K = (K - 1) / 2;
  stringstream SS{};
  SS << S;
  for (auto i = 0; i < K; i++)
  {
    SS << T;
  }
  return SS.str();
}

mint count(int N, string const &X, int K)
{
  assert(N % K == 0);
  assert(K % 2 == 1);
  int L = N / K;
  string S{X.substr(0, L)};
  mint ans{binary(S)};
  string E{expand(S, K)};
  assert(static_cast<int>(E.size()) == N);
  if (E <= X)
  {
    ans += 1;
  }
  return ans;
}

using table = map<int, mint>;

table make_table(int N, string const &X)
{
  table t;
  for (auto i = 1; i <= N; i += 2)
  {
    if (N % i == 0)
    {
      mint c{count(N, X, i)};
      t[N / i] = c;
    }
  }
  for (auto &x : t)
  {
    for (auto i = 2;; i++)
    {
      int tmp{x.first * i};
      if (tmp > N)
      {
        break;
      }
      if (t.find(tmp) != t.end())
      {
        t[tmp] -= x.second;
      }
    }
  }
  return t;
}

mint calc(table const &t)
{
  mint ans{0};
  for (auto &x : t)
  {
    ans += static_cast<mint>(x.first) * x.second;
  }
  return ans * 2;
}

int main()
{
  int N;
  string X;
  cin >> N >> X;
  cout << calc(make_table(N, X)) << endl;
}

Measured memory_bytes: 1532