Infosys Aspiration 2020 2013 college round question-2

Rahul has M friends and they love to play games with marbles. His little sister also wants to join his gang of marble game lovers.
To make it simple for his little sister Rahul creates a simple rule for the marble game of the day. Each participant will be given a set of marbles.
The participant is considered to win the game if they are able to pair up all the marbles they have; else they are said to lose.

Rahul being a coding freak writes a computer program to find out if his little sister would win the game or not. Help Rahul write the program.

INPUT :
The line contains M, the number of friends rahul has. 1<=M<=50
It is followed by M lines, each containing the number of marbles each friend has.
0<M<=1000
(DO NOT PRINT ANY PROMPT ANY MESSAGE TO ENTER THE INPUT.)

OUTPUT:
For each of the M friends, first print the chronological index of the friend followed by a space, then state whether the participant won or lost.
(DO NOT PRINT ANY OTHER MESSAGE OTHER THAN THE RESULTS.)

SAMPLE INPUT :
5
1000
3
56
7
234

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

class psmapa {
 public static void main (String args[]) throws IOException {  
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
  int t = Integer.parseInt(in.readLine());
  int[] n=new int[t];
  int i=0;
  for(i=0;i<t;i++)
  {
  n[i]=Integer.parseInt(in.readLine());
  }
  for(i=0;i<t;i++)
  {  
     if(n[i]>0 && n[i]<=1000)
     {
     if(n[i]%2==0)
       {
        System.out.println(i+1+" won");
       }
    else
    {
        System.out.println(i+1+" lost");
    }
      }
   else
   {
         System.out.println(i+1+" invalid");
   }
  }
  
}
}