Hackerearth -- In love with primes

Hackerearth -- In love with primes

#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){
                                    printf("Deepa\n");
                        }
                        else
                        printf("Arjit\n");
                  }
            }
 
      return 0;
}
 

Goldbach's conjecture is states that every even number is a sum of two odd prime number no need to check its proof just use the method.