#include<cstdio>
int n,x,cnt[601],ans;
int main(){scanf("%d",&n);for(int i=1;i<=n;++i) scanf("%d",&x), cnt[x]++;for(int i=1;i<=600;++i) if(cnt[i]) ++ans;printf("%d",ans);return 0;
}

#include<cstdio>
int p,y;
int main(){scanf("%d%d",&p,&y);for(int i=y;i>p;--i){for(int j=2;j<=p&&j*j<=i;++j) if(i%j==0) goto no;printf("%d",i); return 0;no: continue; } puts("-1");return 0;
}

#include<cstdio>
long long k,d,t,lp,t1,t2;
double ans;
int main(){scanf("%lld%lld%lld",&k,&d,&t); t<<=1;lp=(k-1)/d*d+d; t1=k<<1, t2=lp-k;ans=t/(t1+t2)*lp; t%=t1+t2;if(t<=t1) ans+=(double)t/t1*k;else ans+=k+(double)(t-t1)/t2*(lp-k);printf("%lf",ans);return 0;
}

#include<bits/stdc++.h>
using namespace std;
int n,m,x,y,o,v[2][100001],k[2][100001],t[2][100001];
vector<int> h[100005];
bool D(int u,bool c){if(~k[c][u]) return k[c][u];if(!h[u].size()) return k[c][u]=c;v[c][u]=1;for(int i:h[u]) {if(v[c][i]||v[!c][i]) o=1; if(!v[!c][i]&&D(i,!c)) return t[c][u]=i, v[c][u]=0, k[c][u]=1;}return v[c][u]=0, k[c][u]=0;
}
int main(){scanf("%d%d",&n,&m);for(int i=1;i<=n;++i){scanf("%d",&x);while(x--) scanf("%d",&y), h[i].push_back(y);} scanf("%d",&x);memset(k,-1,sizeof k);if(D(x,0)){puts("Win"); y=1;while(x) printf("%d ",x), x=t[y=!y][x];return 0;} puts(o?"Draw":"Lose");return 0;
}

#include<bits/stdc++.h>
#define F(i,a,b) for(int i=a;i<=(b);++i)
#define dF(i,a,b) for(int i=a;i>=(b);--i)
using namespace std;int n;
char str1[2005],str2[2005],str3[2005],str4[2005];int main(){scanf("%d%s%s",&n,str1+1,str2+1);memcpy(str3+1,str1+1,n);memcpy(str4+1,str2+1,n);sort(str3+1,str3+n+1);sort(str4+1,str4+n+1);if(memcmp(str3+1,str4+1,n)) {puts("-1"); return 0;}printf("%d\n",n*3);dF(i,n,1){int p;F(j,n-i+1,n) if(str1[j]==str2[i]) {p=j; break;}printf("%d %d 1 ",n,p-1);reverse(str1+p+1,str1+n+1);memcpy(str1+2,str1+1,p-1);str1[1]=str2[i];}return 0;
}