#include #include #include #include #include #include #include long int longestSequence(int n, long int a[]) { long int sum=0,j; for(j=0;j1;k--) { if(a[j]%k==0) { count=count+k; int d=a[j]/k; key=k; a[j]=a[j]/d; } } count++; sum=sum+count; } return sum; // Return the length of the longest possible sequence of moves. } int main() { int n,i; scanf("%d", &n); long int a[n]; for(i=0;i