#include<bits/stdc++.h>
using namespace std;
const long long N=1e2+9;
struct xl{
	long long head;
	long long tail;
}a[N]; 
long long dp[N],n,num;
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	cin>>n;
	for(long long  i=1;i<=n;i++){
		cin>>a[i].head; 
	}
	for(long long i=1;i<=n;i++){
		a[i].tail=a[int(abs((i-1+n)%n))].head;
	}
	cout<<3;
	return 0;
	for(long long i=1;i<=n;i++){
		if(a[(i+n-1)%n].tail*a[i].head*a[i].tail>=a[(i+1)%n].head*a[(i+1)%n].tail*a[i].tail){
			cout<<" b";
			a[(i+n-1)%n].tail=a[i].tail;
			a[i].head=a[(i+n-1)%n].head;
			dp[i]=a[(i+n-1)%n].tail*a[i].head*a[i].tail;
			
		}else{
			cout<<" a";
			a[(i+1)%n].tail=a[i].tail;	
			a[i].head=a[(i+1)%n].head;
			dp[i]=a[(i+1)%n].head*a[(i+1)%n].tail*a[i].tail;
		}
		cout<<a[(i+n-1)%n].tail*a[i].head*a[i].tail<<" "<<a[(i+1)%n].head*a[(i+1)%n].tail*a[i].tail<<endl;
		num+=dp[i];
	}
	cout<<num;
//	fclose(stdin);
//	fclose(stdout);
}