Given a array find the largest subsequence which sum is prime no.
constraint :
0<n<=10^4
1<=Ai<10^6
ex :
5
3 4 5 10 2
output:
19
4+5+10=19
Given a array find the largest subsequence which sum is prime no.
constraint :
0<n<=10^4
1<=Ai<10^6
ex :
5
3 4 5 10 2
output:
19
4+5+10=19