#include using namespace std; long longestSequence(vector a) { long int s=a.size(); long int cnt=0; for(long int i=0;i2) { m++; b[m]=a[i]; } long tp=1; cnt+=tp; for(int j=m;j>=0;j--) {tp=tp*b[j]; cnt+=tp;} } return cnt;// Return the length of the longest possible sequence of moves. } int main() { int n; cin >> n; vector a(n); for(int a_i = 0; a_i < n; a_i++){ cin >> a[a_i]; } long result = longestSequence(a); cout << result << endl; return 0; }