ll dp[110][110];
ll mod=998244353;
ll solve(ll i,vector<ll>& a,ll sum,ll chosen)
{
     ll n=a.size();
     if(i==n)
     {
         if(chosen==0)
         {
          return 0;
        }
      // debug(sum)
        if(sum%chosen==0)
            return 1;
        else 
            return 0;
     }
     // cout<<1;
       if(dp[i][chosen]!=-1)
        return dp[i][chosen]%mod;
     return dp[i][chosen]=(solve(i+1,a,sum+a[i],chosen+1)%mod+solve(i+1,a,sum,chosen)%mod)%mod;

}
void solve()
{
     
       ll n;
       cin>>n;
       vi a(n);
       rep(110)
       {
        for(ll j=0;j<110;j++)
            dp[i][j]=-1;
    }

       rep(n)
       cin>>a[i];

      cout<< solve(0,a,0,0);
  

}