description: There are three sticks with integer lengths l_1, l_2 and l_3.
  
  You are asked to break exactly one of them into two pieces in such a way that: 
  
    * both pieces have positive (strictly greater than 0) integer length; 
    * the total length of the pieces is equal to the original length of the stick; 
    * it's possible to construct a rectangle from the resulting four sticks such that each stick is used as exactly one of its sides. 
  
  
  
  A square is also considered a rectangle.
  
  Determine if it's possible to do that.
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
  
  The only line of each testcase contains three integers l_1, l_2, l_3 (1 ≤ l_i ≤ 10^8) — the lengths of the sticks.
  
  Output
  
  For each testcase, print "YES" if it's possible to break one of the sticks into two pieces with positive integer length in such a way that it's possible to construct a rectangle from the resulting four sticks. Otherwise, print "NO".
  
  You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES are all recognized as a positive answer).
  
  Example
  
  Input
  
  
  4
  6 1 5
  2 5 2
  2 4 2
  5 5 4
  
  
  Output
  
  
  YES
  NO
  YES
  YES
  
  Note
  
  In the first testcase, the first stick can be broken into parts of length 1 and 5. We can construct a rectangle with opposite sides of length 1 and 5.
  
  In the second testcase, breaking the stick of length 2 can only result in sticks of lengths 1, 1, 2, 5, which can't be made into a rectangle. Breaking the stick of length 5 can produce results 2, 3 or 1, 4 but neither of them can't be put into a rectangle.
  
  In the third testcase, the second stick can be broken into parts of length 2 and 2. The resulting rectangle has opposite sides 2 and 2 (which is a square).
  
  In the fourth testcase, the third stick can be broken into parts of length 2 and 2. The resulting rectangle has opposite sides 2 and 5.
solution: //---#ON_MY_WAY---
  import static java.lang.Math.*;
  import java.io.*;
  import java.math.*;
  import java.util.*;
  
  public class A {
  	static class pair {
  		int x, y;
  
  		public pair(int a, int b) {
  			x = a;
  			y = b;
  		}
  	}
  
  	static FastReader x = new FastReader();
  	static OutputStream outputStream = System.out;
  	static PrintWriter out = new PrintWriter(outputStream);
  
  	/*---------------------------------------CODE STARTS HERE-------------------------*/
  	public static void main(String[] args) throws NumberFormatException, IOException {
  		long startTime = System.nanoTime();
  		int mod = 1000000007;
  		int t = x.nextInt();
  		StringBuilder str = new StringBuilder();
  		while (t > 0) {
  			int a[] = readarr(3);
  			sortint(a);
  			if((a[0]+a[1])==a[2]) str.append("YES");
  			else if(a[0]==a[1]) {
  				if(a[2]%2==0) str.append("YES");
  				else str.append("NO");
  			}
  			else if(a[1]==a[2]) {
  				if(a[0]%2==0) str.append("YES");
  				else str.append("NO");
  			}
  			else str.append("NO");
  			str.append("\n");
  			t--;
  		}
  		out.println(str);
  		out.flush();
  		long endTime = System.nanoTime();
  		//System.out.println((endTime-startTime)/1000000000.0);
  	}
  
  	/*--------------------------------------------FAST I/O--------------------------------*/
  	static class FastReader {
  		BufferedReader br;
  		StringTokenizer st;
  
  		public FastReader() {
  			br = new BufferedReader(new InputStreamReader(System.in));
  		}
  
  		String next() {
  			while (st == null || !st.hasMoreElements()) {
  				try {
  					st = new StringTokenizer(br.readLine());
  				} catch (IOException e) {
  					e.printStackTrace();
  				}
  			}
  			return st.nextToken();
  		}
  
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  
  		double nextDouble() {
  			return Double.parseDouble(next());
  		}
  
  		String nextLine() {
  			String str = "";
  			try {
  				str = br.readLine();
  			} catch (IOException e) {
  				e.printStackTrace();
  			}
  			return str;
  		}
  
  		char nextchar() {
  			char ch = ' ';
  			try {
  				ch = (char) br.read();
  			} catch (IOException e) {
  				e.printStackTrace();
  			}
  			return ch;
  		}
  	}
  
  	/*--------------------------------------------BOILER PLATE---------------------------*/
  	static int[] readarr(int n) {
  		int arr[] = new int[n];
  		for (int i = 0; i < n; i++) {
  			arr[i] = x.nextInt();
  		}
  		return arr;
  	}
  
  	static int[] sortint(int a[]) {
  		ArrayList<Integer> al = new ArrayList<>();
  		for (int i : a) {
  			al.add(i);
  		}
  		Collections.sort(al);
  		for (int i = 0; i < a.length; i++) {
  			a[i] = al.get(i);
  		}
  		return a;
  	}
  
  	static long[] sortlong(long a[]) {
  		ArrayList<Long> al = new ArrayList<>();
  		for (long i : a) {
  			al.add(i);
  		}
  		Collections.sort(al);
  		for (int i = 0; i < al.size(); i++) {
  			a[i] = al.get(i);
  		}
  		return a;
  	}
  
  	static long pow(long x, long y) {
  		long result = 1;
  		while (y > 0) {
  			if (y % 2 == 0) {
  				x = x * x;
  				y = y / 2;
  			} else {
  				result = result * x;
  				y = y - 1;
  			}
  		}
  		return result;
  	}
  
  	static long pow(long x, long y, long mod) {
  		long result = 1;
  		x %= mod;
  		while (y > 0) {
  			if (y % 2 == 0) {
  				x = (x % mod * x % mod) % mod;
  				y /= 2;
  			} else {
  				result = (result % mod * x % mod) % mod;
  				y--;
  			}
  		}
  		return result;
  	}
  
  	static int[] revsort(int a[]) {
  		ArrayList<Integer> al = new ArrayList<>();
  		for (int i : a) {
  			al.add(i);
  		}
  		Collections.sort(al, Comparator.reverseOrder());
  		for (int i = 0; i < a.length; i++) {
  			a[i] = al.get(i);
  		}
  		return a;
  	}
  
  	static int[] gcd(int a, int b, int ar[]) {
  		if (b == 0) {
  			ar[0] = a;
  			ar[1] = 1;
  			ar[2] = 0;
  			return ar;
  		}
  		ar = gcd(b, a % b, ar);
  		int t = ar[1];
  		ar[1] = ar[2];
  		ar[2] = t - (a / b) * ar[2];
  		return ar;
  	}
  
  	static boolean[] esieve(int n) {
  		boolean p[] = new boolean[n + 1];
  		Arrays.fill(p, true);
  		for (int i = 2; i * i <= n; i++) {
  			if (p[i] == true) {
  				for (int j = i * i; j <= n; j += i) {
  					p[j] = false;
  				}
  			}
  		}
  		return p;
  	}
  
  	static ArrayList<Integer> primes(int n) {
  		boolean p[] = new boolean[n + 1];
  		ArrayList<Integer> al = new ArrayList<>();
  		Arrays.fill(p, true);
  		int i = 0;
  		for (i = 2; i * i <= n; i++) {
  			if (p[i] == true) {
  				al.add(i);
  				for (int j = i * i; j <= n; j += i) {
  					p[j] = false;
  				}
  			}
  		}
  		for (i = i; i <= n; i++) {
  			if (p[i] == true) {
  				al.add(i);
  			}
  		}
  		return al;
  	}
  
  	static int etf(int n) {
  		int res = n;
  		for (int i = 2; i * i <= n; i++) {
  			if (n % i == 0) {
  				res /= i;
  				res *= (i - 1);
  				while (n % i == 0) {
  					n /= i;
  				}
  			}
  		}
  		if (n > 1) {
  			res /= n;
  			res *= (n - 1);
  		}
  		return res;
  	}
  
  	static int gcd(int a, int b) {
  		if (a == 0) {
  			return b;
  		}
  		return gcd(b % a, a);
  	}
  
  	static long gcd(long a, long b) {
  		if (a == 0) {
  			return b;
  		}
  		return gcd(b % a, a);
  	}
  }