/**
 *    author:  otera    
**/
#include<iostream>
#include<string> 
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm> 
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

// modint: mod 計算を int を扱うように扱える構造体
template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {
        return is >> x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};

// 二項係数ライブラリ
template<class T> struct BiCoef {
    vector<T> fact_, inv_, finv_;
    constexpr BiCoef() {}
    constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
        init(n);
    }
    constexpr void init(int n) noexcept {
        fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
        int MOD = fact_[0].getmod();
        for(int i = 2; i < n; i++){
            fact_[i] = fact_[i-1] * i;
            inv_[i] = -inv_[MOD%i] * (MOD/i);
            finv_[i] = finv_[i-1] * inv_[i];
        }
    }
    constexpr T com(int n, int k) const noexcept {
        if (n < k || n < 0 || k < 0) return 0;
        return fact_[n] * finv_[k] * finv_[n-k];
    }
    constexpr T fact(int n) const noexcept {
        if (n < 0) return 0;
        return fact_[n];
    }
    constexpr T inv(int n) const noexcept {
        if (n < 0) return 0;
        return inv_[n];
    }
    constexpr T finv(int n) const noexcept {
        if (n < 0) return 0;
        return finv_[n];
    }
};

//const int MOD = 1000000007;
const int MOD = 998244353;
using mint = Fp<MOD>;
BiCoef<mint> bc;

int f(int x, int sz) {
	if(x % 2 == 1) return (x - 1)>>1;
	return (x>>1) + (1<<(sz - 1));
}

//実験コード
set<int> cnt(int sz) {
	set<int> se;
	for(int i = 0; i < (1<<sz); ++ i) {
		int co = 0;
		int now = i;
		while(f(now, sz) != i) {
			now = f(now, sz);
			++ co;
		}
		if(se.find(co + 1) == se.end() && co + 1 != 2 * sz) {
			cerr << "example " << sz << " " << bitset<15>(i) << endl;
		}
		se.insert(co + 1);
	}
	return se;
}

string rev(string s) {
	int sz = (int)s.size();
	string res = "";
	rep(i, sz) {
		if(s[i] == '0') res += '1';
		else res += '0';
	}
	return res;
}

mint val(string s) {
	int sz = (int)s.size();
	mint res = 0;
	mint pw = (mint)1;
	per(i, sz) {
		if(s[i] == '1') res += pw;
		pw *= (mint)2;
	}
	return res;
}

vector<int> pf(int x) {
	vector<int> res;
	for(int i = 2; i * i <= x; ++ i) {
		if(x % i == 0) {
			res.pb(i);
			while(x % i == 0) x /= i;
		}
	}
	if(x != 1) res.pb(x);
	return res;
}

void solve() {
	// for(int i = 1; i <= 15; ++ i) {
	// 	cerr << i << " ";
	// 	for(auto x: cnt(i)) {
	// 		cerr << x << " ";
	// 	}
	// 	cerr << endl;
	// }
	int n; string x; cin >> n >> x;
	map<int, mint> mp;
	for(int d = 1; d * d <=2 * n; ++ d) {
		if((2 * n) % d == 0) {
			int d1 = d, d2 = (2 * n) / d1;
			if(d1 % 2 == 1) {
				//周期がd2
				string s = x.substr(0, d2 / 2);
				string revs = rev(s);
				string t = "";
				rep(i, d1) {
					if(i % 2 == 0) {
						t += s;
					} else {
						t += revs;
					}
				}
				if(t > x) {
					mp[d2] = val(s);
				} else {
					mp[d2] = val(s) + (mint)1;
				}
			}
			if(d2 % 2 == 1) {
				//周期がd1
				string s = x.substr(0, d1 / 2);
				string revs = rev(s);
				string t = "";
				rep(i, d2) {
					if(i % 2 == 0) {
						t += s;
					} else {
						t += revs;
					}
				}
				if(t > x) {
					mp[d1] = val(s);
				} else {
					mp[d1] = val(s) + (mint)1;
				}
			}
		}
	}
	mint ans = 0;
	for(auto p: mp) {
		int num = p.fr; mint co = p.sc;
		for(auto& q: mp) {
			int num1 = q.fr;
			if(num1 % num == 0) {
				q.sc -= co;
			}
		}
		ans += co * (mint)num;
	}
	cout << ans << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)solve();
	solve();
    return 0;
}

Measured memory_bytes: 1300