#include <iostream>
using namespace std;
int n;
int *mas;
int *st;
int k = 0;
long long sum = 0;
bool flag = 0;
long long multiply_el() {
	long long mult = 1;
	for (int i = 0; i < n; i++) {
		if (i % 2 == 0) {
			mult *= mas[i];
		}
	}
	return mult;
}
int summ () {
	long long sum = 0;
	for (int i = 0; i < n; i++) {
		if (!mas[i]) {
			st[k++] = i;
		}
	}
	if (k) {
		for (int i = st[0]; i < st[k - 1]; i++) {
			sum += mas[i];
		}
	}
	return sum;
}
void read() {
	for (int i = 0; i < n; i++) {
		cin >> mas[i];
	}
}
int main () {
	cin >> n;
	mas = new int[n];
	st = new int[n];
	read();
	if (k) {
		for (int i = st[0]; i < st[k - 1]; i++) {
			sum += mas[i];
		}
	}
	cout << "even elements multiply " << multiply_el() << endl;
	cout << "elemts sum beatween first and last zero " << summ() << endl;
	return 0;
}