#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
using ll = long long;
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define show(x) true
#endif

template<unsigned int mod_>
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	constexpr static uint mod = mod_;

	uint v;
	ModInt():v(0){}
	ModInt(ll _v):v(normS(_v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ModInt& operator++(int){ return *this=*this+1;}
	ModInt& operator--(int){ return *this=*this-1;}
	ll extgcd(ll a,ll b,ll &x,ll &y) const{
		ll p[]={a,1,0},q[]={b,0,1};
		while(*q){
			ll t=*p/ *q;
			rep(i,3) swap(p[i]-=t*q[i],q[i]);
		}
		if(p[0]<0) rep(i,3) p[i]=-p[i];
		x=p[1],y=p[2];
		return p[0];
	}
	ModInt inv() const {
		ll x,y;
		extgcd(v,mod,x,y);
		return make(normS(x+mod));
	}
	ModInt pow(ll p) const {
		if(p<0) return inv().pow(-p);
		ModInt a = 1;
		ModInt x = *this;
		while(p){
			if(p&1) a *= x;
			x *= x;
			p >>= 1;
		}
		return a;
	}
	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<998244353>;
struct UnionFind{
	int g;
	vector<int> par,rank;
	UnionFind(int N){
		g = N;
		par.assign(N,0);
		rank.assign(N,0);
		rep(i,N) par[i]=i;
	}
	int find(int x){
		if(par[x]==x) return x;
		return par[x]=find(par[x]);
	}
	bool same(int x,int y){
		return find(x)==find(y);
	}
	void unite(int x,int y){
//		cerr << "UNITE" << x << "," << y << endl;
		x=find(x),y=find(y);
		if(x==y) return;
		g--;
		if(rank[x]<rank[y]) swap(x,y);

		//x becomes root
		par[y]=x;
		if(rank[x]==rank[y]) rank[x]++;
	}
};

V<mint> p2;

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);
	
	int N; string X;
	cin >> N >> X;

	p2.pb(1); rep(i,2*N) p2.pb(p2.back()*2);

	V<int> gs;
	V<mint> as;

	rep1(g,2*N) if(2*N%g == 0){
		show("-0p-----------------");show(g);
		gs.pb(g);
		UnionFind UF(N+N);
		if(g != 2*N){
			rep(i,N){
				if(i < N-g){
					UF.unite(i,g+i), UF.unite(i+N,g+i+N);
				}
				else{
					UF.unite(i,N+i-(N-g)), UF.unite(i+N,i-(N-g));
				}
			}
		}
		{
			bool done = false;
			rep(i,N){
				if(UF.same(i,N+i)){
					as.pb(0);
					done = true;
					break;
				}
			}
			if(done) continue;
		}
		show(g);
		show(UF.g);

		V<int> c(2*N,-1);
		mint res = 0;
		int f = UF.g/2;
		bool broken = false;
		rep(i,N){
			int r = UF.find(i), rr = UF.find(i+N);
			if(X[i] == '1'){
				if(c[r] == -1){
					res += p2[f-1];
				}else if(c[r] == 0){
					res += p2[f];
				}
			}
			if(c[r] != -1 && (c[r] != X[i]-'0')){
				broken = true;
				break;
			}
			if(c[r] == -1){
				show(i); show(r);
				c[r] = X[i]-'0';
				c[rr] = 1 - (X[i]-'0');
				f--;
			}
		}
		if(!broken){
			assert(f == 0);
			res++;
		}
		as.pb(res);
	}
	show(gs);
	show(as);
	int K = gs.size();
	rep(i,K) rep(j,i) if(gs[i]%gs[j] == 0) as[i] -= as[j];
	show(as);
	mint ans = 0;
	rep(i,K) ans += mint(1) * gs[i] * as[i];
	cout << ans << endl;
}


Measured memory_bytes: 8252