#include using namespace std; #define ll long long int n; bool vis[1000005]; vector prim; ll li[105]; void sieve() { for(int i=2;i<=1000000;i++) { if(!vis[i]) continue; prim.push_back(i); if(i>1000) continue; for(int j=i;j*i<=1000000;j++) { vis[i*j]=0; } } return; } int main() { memset(vis,1,sizeof(vis)); sieve(); scanf("%d",&n); ll tot=0; for(int i=1;i<=n;i++) { scanf("%lld",&li[i]); tot+=li[i]; } for(int i=0;i