//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#ifdef DEBUG
#include "./Lib/debug_VC.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

/* constant value */
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;

//=============================================================================================;

auto solve_c(ll n, const string& s)->ll {
	auto s_bit = bitset<40>(s);
	ll ans = 0;
	unordered_map<ll, ll> mp;
	REP(i, s_bit.to_ullong() + 1) {
		ll cnt = 0;
		ll k = i;
		do {
			ll b = !(k & 1);
			k |= (b << n);
			k >>= 1;
			++cnt;
		} while (k != i);
		ans += cnt;
		mp[cnt]++;
	}
	return ans;
}

auto solve(ll n, const string& s) {

	VL dp(n + 1);
	FOR(i, 1, n + 1) {
		dp[i] = (dp[i - 1] << 1);
		dp[i] |= (s[i - 1] == '1');
		if (dp[i] >= MOD) { dp[i] %= MOD; }
	}
	dump(dp);

	VL ans_v(n + 1);
	FOR(i, 1, n + 1) {
		ll d = n / i;
		if (n % i > 0 || !(d & 1)) { ans_v[i] = -1; continue; }
		ll mx = dp[i];
		ans_v[i] += mx * i * 2;
		if (ans_v[i] >= MOD) { ans_v[i] %= MOD; }
		// ピッタリ賞
		bool ok = true;
		string t = s.substr(0, i);
		REP(j, n) {
			char base = s[j];
			char now = t[j % i];
			if ((j / i) & 1) { now = (now == '1') ? '0' : '1'; }
			if (base == '1' && now == '0') { break; }
			if (base == '0' && now == '1') { ok = false; break; }
		}
		if (ok) { ans_v[i] += i * 2; }
		if (ans_v[i] >= MOD) { ans_v[i] %= MOD; }
	}

	FOR(i, 1, n + 1)if (ans_v[i] > -1) {
		FOR(k, 2, n + 10) {
			ll ik = i * k;
			if (ik > n) { break; }
			if (ans_v[ik] == -1) { continue; }
			ll dec = (ans_v[i] * k);
			if (dec >= MOD) { dec %= MOD; }
			ans_v[ik] -= dec;
			if (ans_v[ik] < 0) { ans_v[ik] += MOD; }
		}
	}

	ll ans = 0;
	REPC(x, ans_v) if (x > -1) { 
		ans += x; 
		if (ans >= MOD) { ans -= MOD; }
	}
	return ans;
}
signed main() {
	ll n;
	cin >> n;
	string s;
	cin >> s;

	auto ans = solve(n, s);
	cout << ans << endl;

	//auto ans_c = solve_c(n, s);
	//dump(ans_c);
}

Measured memory_bytes: 3860