C++ :

#include<bits/stdc++.h>
using namespace std;
long long n,a,t=1,s;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a;
		if(i%2==0)t*=a;
		if(i%2==1)s+=a;
	}
	cout<<s<<" "<<t;
   return 0;
}

Pascal :

var n,i,max,min:longint;
    a:array[1..100] of longint;
begin
  readln(n);
  max:=0;
  min:=1;
  for i:=1 to n do
      begin
        read(a[i]);
        if i mod 2=1 then max:=max+a[i];
        if i mod 2=0 then min:=min*a[i];
      end;
  writeln(max,' ',min);
end.