C :

#include<stdio.h>
int main()
{
	int n,i;
	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==1){
			printf("%d ",a[i]); 
		}
	}
	printf("\n"); 
	for(i=0;i<n;i++){
		if(a[i]%2==0){
			printf("%d ",a[i]); 
		}
	}
	
	return 0;
	
}

C++ :

#include<iostream>
#include<iomanip>
using namespace std;

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

Pascal :

var a,b,c:array[1..10000] of longint;
i,d:longint;
begin
read(d);
for i:=1 to d do
read(a[i]);
for i:=1 to d do
if a[i] mod 2=1 then c[i]:=a[i]
                else b[i]:=a[i];
for i:=1 to d do
if c[i]<>0 then write(c[i],' ');
writeln;
for i:=1 to d do
if b[i]<>0 then write(b[i],' ');
end.

Java :

import java.util.Scanner;

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

Python :

n=int(input())
l1=list(map(int,input().split()))
def ck(n):
    if i%2==0:
        return 1
    else:
        return 2
for i in l1:
    if ck(i)==2:
        print(i,end=' ')
print() 
for i in l1:       
    if ck(i)==1:
        print(i,end=' ')