shohan4556

///URI OJ :1663 
///Author : Shohanur Rahaman

#include<stdio.h>

    int ara[1000005];
    int invara[1000005];

int main()
{

shohan4556

/// URI : 1436
/// Author : Shohanur Rahaman

#include<stdio.h>
int main()
{
	int tc,n,i,tmp,j;
	int player[9];
	int t=0;
		scanf("%d",&tc);

shohan4556

/// URI : 1467 -- Zero or One
/// Author : Shohanur Rahaman

#include<stdio.h>
int main()
{
		int a,b,c;

	while(scanf("%d %d %d",&a,&b,&c)==3){
				if(a==0 && b==0 && c==0)

shohan4556

/// Author : Shohan
/// URI OJ : 1426 - Add Bricks in The Wall

#include<stdio.h>
int row2(int, int );
int row(int ,int ,int );

int ara9[9],ara2[2],ara4[4],ara6[6],ara8[8],ara3[3],ara5[5],ara7[7];
int r1,r2,r3,r4,r5,r6,r7,r8,r9,r10,r11,r12,r13,r14,r15,r16;

shohan4556

/// URI : 1609
/// Author : Shohanur Rahaman

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

int ara[10000];
int main()
{

shohan4556

/// Author : Shohan
/// URI Oj - 1743  (Automated Checking Machine)
/// Mail : [email protected]

#include<stdio.h>
#define N 5
int correct[N];

void corre(int ara[]);

shohan4556

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

int gcd(int a, int b, int &x, int &y) {
  if (a == 0) {
    x = 0; y = 1;
    return b;
  }

shohan4556

/// Solved By Shohanur Rahaman

#include<stdio.h>
#include<math.h>

int sumofdiv(int n);

int main()
{

shohan4556

/// Author : Shohan
/// URI 1323
/// Problem level  : Easy

#include<stdio.h>
int main()
{
      int ans,n,t;
            while(scanf("%d",&n)==1){
                  if(n==0)

shohan4556

#include<stdio.h>
#include<math.h>
 
int main()
{
      int tc,n,i,a;
            while(scanf("%d",&tc)==1){
                  for(i=1;i<=tc;i++){
                        scanf("%d",&n);
                        if(n%2==0 && n>=4){