C++ :

#include <bits/stdc++.h>
using namespace std;
int main(){
	int n,a[110],i,j;
	cin>>n;
	for(i = 0;i < n;i++){
		cin>>a[i];
		
		while(a[i] < 10 || a[i] % 4 != 0) {
			a[i]++;
		}
	}
	
	for(i = 1;i < n;i++){
		for(j = 0;j < n - i;j++){
			if(a[j] < a[j+1]){
				swap(a[j],a[j+1]);
			}
		}
	}
	
	for(i = 0;i < n;i++){
		cout<<a[i]<<" ";
	}
	
}

Java :

import java.util.Scanner;



public class Main {

	public static void main(String[] args) {
		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();
		}
		int[] b=buChong(a);
		paiXu(b);
		for(int i=0;i<b.length;i++){
			System.out.print(b[i]+" ");
		}
	}
	public static int[] buChong(int[] a){
		int[] b=new int[a.length];
		int m=0;
		for(int i=0;i<a.length;i++){
			if(a[i]>=10&&a[i]%4==0){
				b[m]=a[i];
				m++;
			}else{
				for(int j=1;;j++){
					if((a[i]+j)%4==0){
						b[m]=a[i]+j;
						m++;
						break;
					}
				}
			}
		}
		return b;
	}
	public static void paiXu(int[] a){
		for(int i=1;i<a.length;i++){
			for(int j=0;j<a.length-i;j++){
				if(a[j]<a[j+1]){
					int temp;
					temp=a[j];
					a[j]=a[j+1];
					a[j+1]=temp;
				}
			}
		}
	}
		
	
	
}

Python :

n=int(input())
a=input().split()
a=list(map(int,a))
for i in range(n):
    b=a[i]
    while(b<12 or b%4!=0):
        b=b+1
    a[i]=b
a=sorted(a)
a.reverse()
for i in a:
    print(i,end=" ")