// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
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;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 998244353;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

template <typename T>
T power(T a, T n, T mod) {
  T res = 1;
  T tmp = n;
  T curr = a;
  while(tmp){
    if(tmp % 2 == 1){
      res = (T)(res * curr % mod);
    }
    curr = (T)(curr * curr % mod);
    tmp >>= 1;
  }

  return res;
}

ll dp[200010][2][2];

int main(int argc, char const* argv[])
{
  int n; cin >> n;
  string x; cin >> x;
  vector<ll> F(2 * n + 1, 0);
  ll all = 0;
  rep(i, sz(x)){
    all = 2 * all % mod + (x[i] == '1' ? 1: 0);
    all %= mod;
  }
  string X = x + x;
  FOR(i, n, 2 * n){
    X[i] = (X[i] == '1' ? '0': '1');
  }
  // calc
  for(int i = 2; i <= 2 * n; i++){
    if((2 * n) % i != 0)continue;
    if((2 * n / i) % 2 == 0)continue;
    ll tmp = 0;
    rep(j, i / 2){
      tmp = tmp * 2 % mod + (x[j] == '1' ? 1: 0);
      tmp %= mod;
    }
    F[i] = tmp;

    string xx = x;
    for(int j = 0; j < sz(x); j += (i / 2)){
      if((j / (i / 2)) % 2 == 1){
        rep(k, (i / 2)){
          xx[j + k] = (x[k] == '1' ? '0': '1');
        }
      }else{
        rep(k, (i / 2)){
          xx[j + k] = x[k];
        }
      }
    }
    if(xx <= x)F[i]++;
  }

  for(int i = 1; i <= 2 * n; i++){
    if((2 * n) % i != 0)continue;
    for(int j = 2; j * i <= 2 * n; j++){
      (F[i * j] -= F[i]) %= mod;
    }
  }
  ll res = 0;
  FOR(i, 1, 2 * n + 1){
    if((2 * n) % i != 0)continue;
    if((2 * n / i) % 2 == 0)continue;
    res = (res + i * F[i] % mod) % mod;
  }
  if(res < 0)res += mod;
  cout << res << endl;
  return 0;
}


Measured memory_bytes: 4176