C :

#include<stdio.h>
main()
{
	int i,n,b=0,c=0;
	scanf("%d",&n);
	int a[n];
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
	}
	for(i=0;i<n;i++)
	{
		if(a[i]%2!=0)
		{
			b+=a[i];
		}
		else
		c+=a[i];
	}
	printf("%d\n%d",b,c);
}

C++ :

#include <iostream>
using namespace std;

int main(){
	int i,n,j=0,o=0;
	int a[5000];
	cin>>n;
	for(i=0;i<n;i++){
		cin>>a[i];
		if(a[i]%2!=0){
			j=j+a[i];
		}else{
			o=o+a[i];
		}
	}
	cout<<j<<endl;
	cout<<o<<endl;
	
}

Pascal :

var a:array[1..100000] of longint;
    n,i,x,y:longint;
begin
read(n);
for i:=1 to n do
read(a[i]);
for i:=1 to n do
begin
if a[i] mod 2=1 then x:=x+a[i]
else y:=y+a[i];
end;
write(x,' ',y);
end.

Java :

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		@SuppressWarnings("resource")
		Scanner sc=new Scanner(System.in);
		int a=sc.nextInt();
		int[] n=new int[a];
		for(int i=0;i<a;i++) {
			n[i]=sc.nextInt();		
		}	
		int j=0,o=0;
		for(int i=0;i<n.length;i++) {
			if(n[i]%2==0) {
				o+=n[i];
				
		}	
			else {
				j+=n[i];				
			}
		}System.out.println(j);
		System.out.println(o);
  }
}

Python :

n=int(input())
l1=[]
for i in range(1,n+1):
    a=int(input())
    l1.append(a)
a=0
b=0
for i in range(0,n):
    if l1[i]%2==0:
        a+=l1[i]
    else:
        b+=l1[i]
print(b,a)