#include<bits/stdc++.h>
using namespace std;
typedef int ll;
typedef long long int li;
const ll MAXN=3e5+51,MOD=998244353,G=3,INVG=332748118;
ll exponent,fd,cnt=1,limit=-1,rres,ptr;
ll rev[MAXN],f[MAXN],g[MAXN],tmp[MAXN],tmp2[MAXN],tmp3[MAXN],tbm[MAXN];
ll res[MAXN],base[MAXN],fail[MAXN];
li delta[MAXN];
inline ll read()
{
    register ll num=0,neg=1;
    register char ch=getchar();
    while(!isdigit(ch)&&ch!='-')
    {
        ch=getchar();
    }
    if(ch=='-')
    {
        neg=-1;
        ch=getchar();
    }
    while(isdigit(ch))
    {
        num=(num<<3)+(num<<1)+(ch-'0');
        ch=getchar();
    }
    return num*neg;
}
inline ll qpow(ll base,ll exponent)
{
    li res=1;
    while(exponent)
    {
        if(exponent&1)
        {
            res=1ll*res*base%MOD;
        }
        base=1ll*base*base%MOD,exponent>>=1;
    }
    return res;
}
inline void NTT(ll *cp,ll cnt,ll inv)
{
    ll cur=0,res=0,omg=0;
    for(register int i=0;i<cnt;i++)
    {
        if(i<rev[i])
        {
            swap(cp[i],cp[rev[i]]);
        }
    }
    for(register int i=2;i<=cnt;i<<=1)
    {
        cur=i>>1,res=qpow(inv==1?G:INVG,(MOD-1)/i);
        for(register ll *p=cp;p!=cp+cnt;p+=i)
        {
            omg=1;
            for(register int j=0;j<cur;j++)
            {
                ll t=1ll*omg*p[j+cur]%MOD,t2=p[j];
                p[j+cur]=(t2-t+MOD)%MOD,p[j]=(t2+t)%MOD;
                omg=1ll*omg*res%MOD;
            }
        }
    }
    if(inv==-1)
    {
        ll invl=qpow(cnt,MOD-2);
        for(register int i=0;i<=cnt;i++)
        {
            cp[i]=1ll*cp[i]*invl%MOD;
        }
    }
}
inline void inv(ll fd,ll *f,ll *res)
{
    static ll tmp[MAXN];
    if(fd==1)
    {
        res[0]=qpow(f[0],MOD-2);
        return;
    }
    inv((fd+1)>>1,f,res);
    ll cnt=1,limit=-1;
    while(cnt<(fd<<1))
    {
        cnt<<=1,limit++;
    }
    for(register int i=0;i<cnt;i++)
    {
        tmp[i]=i<fd?f[i]:0;
        rev[i]=(rev[i>>1]>>1)|((i&1)<<limit);
    }
    NTT(tmp,cnt,1),NTT(res,cnt,1);
    for(register int i=0;i<cnt;i++)
    {
        res[i]=1ll*(2-1ll*tmp[i]*res[i]%MOD+MOD)%MOD*res[i]%MOD;
    }
    NTT(res,cnt,-1);
    for(register int i=fd;i<cnt;i++)
    {
        res[i]=0;
    }
}
inline void mod(ll *f)
{
    static ll tmp[MAXN],q[MAXN];
    ll deg=fd<<1;
    while(!f[--deg]);
    if(deg<fd)
    {
	return;
    }
    for(register int i=0;i<cnt;i++)
    {
    	tmp[i]=i<=deg?f[i]:0;
    }
    reverse(tmp,tmp+1+deg);
    for(register int i=deg+1-fd;i<=deg;i++)
    {
    	tmp[i]=0;
    }
    NTT(tmp,cnt,1);
    for(register int i=0;i<cnt;i++)
    {
    	q[i]=(li)tmp[i]*tmp3[i]%MOD;
    }
    NTT(q,cnt,-1);
    for(register int i=0;i<cnt;i++)
    {
    	tmp[i]=0;
    	q[i]=i<=deg-fd?q[i]:0;
    }
    reverse(q,q+1+deg-fd),NTT(q,cnt,1);
    for(register int i=0;i<cnt;i++)
    {
        tmp[i]=(li)q[i]*g[i]%MOD;
    }
    NTT(tmp,cnt,-1);
    for(register int i=0;i<fd;i++)
    {
        f[i]=(f[i]-tmp[i]+MOD)%MOD;
    }
    for(register int i=0;i<cnt;i++)
    {
        q[i]=tmp[i]=0,f[i]=i<fd?f[i]:0;
    }
}
vector<li>bmf[MAXN];
inline void BerlekampMassey(ll length,ll *base,ll *res)
{
	ll cur=0;
    for(register int i=1;i<=length;i++)
    {
    	li curr=base[i];
        for(register int j=0;j<bmf[cur].size();j++)
        {
            curr=(curr-(li)base[i-j-1]*bmf[cur][j]%MOD)%MOD;
        }
        delta[i]=curr;
        if(!delta[i])
        {
            continue;
        }
        fail[cur]=i;
        if(!cur)
        {
            bmf[++cur].resize(i),delta[i]=base[i];
            continue;
        } 
        ll id=cur-1,x=bmf[id].size()-fail[id]+i;
        for(register int j=0;j<cur;j++)
        {
            if(i-fail[j]+bmf[j].size()<x)
            {
            	id=j,x=i-fail[j]+bmf[j].size();
            }
        }
        bmf[cur+1]=bmf[cur],cur++;
        while(bmf[cur].size()<x)
        {
            bmf[cur].push_back(0);
        }
        li mul=(li)delta[i]*qpow(delta[fail[id]],MOD-2)%MOD;
        bmf[cur][i-fail[id]-1]=(li)(bmf[cur][i-fail[id]-1]+mul)%MOD;
        for(register int j=0;j<bmf[id].size();j++)
        {
            ll t=(li)mul*bmf[id][j]%MOD;
            bmf[cur][i-fail[id]+j]=(bmf[cur][i-fail[id]+j]-t+MOD)%MOD;
        }
    }
    ptr=cur;
    for(register int i=0;i<bmf[cur].size();i++)
    {
    	res[i+1]=(bmf[cur][i]%MOD+MOD)%MOD;
    }
} 
int main()
{
    fd=read();
    exponent=0;
    for(register int i=0;i<fd;i++)
    {
    	tbm[i+1]=f[i]=(read()+MOD)%MOD;
    }
    BerlekampMassey(fd,tbm,tmp);
	printf("%d\n",bmf[ptr].size());
    for(register int i=1;i<=bmf[ptr].size();i++)
    {
    	//printf("%d ",tmp[i]);
    }

}