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: import java.util.*;
  import java.io.*;
  import java.io.DataInputStream;
  import java.io.FileInputStream;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.Scanner;
  import java.util.StringTokenizer;
  public class Main{
      static class Reader {
          final private int BUFFER_SIZE = 1 << 16;
          private DataInputStream din;
          private byte[] buffer;
          private int bufferPointer, bytesRead;
   
          public Reader() {
              din = new DataInputStream(System.in);
              buffer = new byte[BUFFER_SIZE];
              bufferPointer = bytesRead = 0;
          }
   
          public Reader(String file_name) throws IOException {
              din = new DataInputStream(
                  new FileInputStream(file_name));
              buffer = new byte[BUFFER_SIZE];
              bufferPointer = bytesRead = 0;
          }
   
          public String readLine() throws IOException {
              byte[] buf = new byte[64]; // line length
              int cnt = 0, c;
              while ((c = read()) != -1) {
                  if (c == '\n') {
                      if (cnt != 0) {
                          break;
                      }
                      else {
                          continue;
                      }
                  }
                  buf[cnt++] = (byte)c;
              }
              return new String(buf, 0, cnt);
          }
   
          public int nextInt() throws IOException {
              int ret = 0;
              byte c = read();
              while (c <= ' ') {
                  c = read();
              }
              boolean neg = (c == '-');
              if (neg)
                  c = read();
              do {
                  ret = ret * 10 + c - '0';
              } while ((c = read()) >= '0' && c <= '9');
   
              if (neg)
                  return -ret;
              return ret;
          }
   
          public long nextLong() throws IOException {
              long ret = 0;
              byte c = read();
              while (c <= ' ')
                  c = read();
              boolean neg = (c == '-');
              if (neg)
                  c = read();
              do {
                  ret = ret * 10 + c - '0';
              } while ((c = read()) >= '0' && c <= '9');
              if (neg)
                  return -ret;
              return ret;
          }
   
          public double nextDouble() throws IOException {
              double ret = 0, div = 1;
              byte c = read();
              while (c <= ' ') c = read();
              boolean neg = (c == '-');
              if (neg) c = read();
   
              do {
                  ret = ret * 10 + c - '0';
              } while ((c = read()) >= '0' && c <= '9');
              if (c == '.') {
                  while ((c = read()) >= '0' && c <= '9') {
                      ret += (c - '0') / (div *= 10);
                  }
              }
              if (neg) return -ret;
              return ret;
          }
   
          private void fillBuffer() throws IOException {
              bytesRead = din.read(buffer, bufferPointer = 0,
                                   BUFFER_SIZE);
              if (bytesRead == -1)
                  buffer[0] = -1;
          }
          private byte read() throws IOException {
              if (bufferPointer == bytesRead)
                  fillBuffer();
              return buffer[bufferPointer++];
          }
   
          public void close() throws IOException {
              if (din == null)
                  return;
              din.close();
          }
      }
      static class Kattio extends PrintWriter {
          private BufferedReader r;
          private StringTokenizer st;
      
          // standard input
          public Kattio() { this(System.in, System.out); }
          public Kattio(InputStream i, OutputStream o) {
              super(o);
              r = new BufferedReader(new InputStreamReader(i));
          }
          // USACO-style file input
          public Kattio(String problemName) throws IOException {
              super(new FileWriter(problemName + ".out"));
              r = new BufferedReader(new FileReader(problemName + ".in"));
          }
      
          // returns null if no more input
          public String next() {
              try {
                  while (st == null || !st.hasMoreTokens())
                      st = new StringTokenizer(r.readLine());
                  return st.nextToken();
              } catch (Exception e) { }
              return null;
          }
      
          public int nextInt() { return Integer.parseInt(next()); }
          public double nextDouble() { return Double.parseDouble(next()); }
          public long nextLong() { return Long.parseLong(next()); }
      }
      public static void main(String[] args)throws IOException {
          int t = sc.nextInt();
          while(t-->0) {
              solve();
          }
          out.close();
      }
      static Kattio sc = new Kattio();
      static long  mod  = (long)1e9+7;
      static PrintWriter out =new PrintWriter(System.out);
      public static void buildHeap(int arr[], int n) {
          for(int i = n/2-1;i>=0;i--) {
              heapify(arr,n,i);
          }
          
      }
   
      //Heapify function to maintain heap property.
      public static void heapify(int arr[], int n, int i) {
          int l = i*2 + 1 , r = i*2 + 2;
          int small = l;
          if(r<n&& arr[r]<arr[small]) {
              small = r;
          }
          if(l>=n || arr[i]< arr[small]) return;
          if(small != i)swap(small, i, arr);
          heapify(arr,n,small);
      }
      public static void swap(int i,int j,int arr[]) {
          int temp = arr[i];
          arr[i] = arr[j];
          arr[j] = temp;
      }
      public static void heapSort(int arr[], int n) {
          buildHeap(arr,n);
          System.out.println(Arrays.toString(arr));
          int ans[] = new int[n];
          int l = 0 , r = n-1;
          while(l<=r) {
              swap(l,r,arr);
              r--;
              heapify(arr,r + 1,0);
              
          }       
      }
      public static long getInversion(String a) {
          long zero =0;
          for(char ch : a.toCharArray()) {
              if(ch=='0') zero++;
          }
          long ans = 0;
          for(char ch : a.toCharArray()) {
              if(ch=='1') {
                  ans += zero;
              }
              else zero--;
          }
          return  ans;
      }
      public static List<Integer> getAllParent (int node) {
          List<Integer> list = new ArrayList<>();
          while(node >= 1) {
              list.add(node);
              node /= 2;
          }
          return list;
      }
      public static void solve()throws IOException  {
          int a[] = new int[3];
          for(int i =0;i<3;i++) {
              a[i] = sc.nextInt();
          }
          Arrays.sort(a);
          if(a[0] == a[1]) {
              if(a[2]%2 == 0)System.out.println("YES");
              else System.out.println("NO");
          }
          else if(a[1] == a[2]) {
              if(a[0]%2 == 0) System.out.println("YES");
              else System.out.println("NO");
          }
          else {
              if(a[0] + a[1] == a[2]) System.out.println("YES");
              else System.out.println("NO");
          }
  
      }   
      public static int getFactor(int num) {
          if(num==1) return 1;
          int ans = 2;
          int k = num/2;
          for(int i = 2;i<=k;i++) {
              if(num%i==0) ans++;
          }
          return Math.abs(ans);
      }
      public static long pow(long a ,long b,long mod) {
          if(b==0) return 1l;
          if(b==1) return a;
          long ans = pow(a,b/2,mod)%mod;
          if(b%2==1) {
              return (((ans*ans)%mod)*a)%mod;
          }
          return (ans*ans)%mod;
      }
  
      public static int geti(char ch) {
          if(ch=='R') return 2;
          if(ch=='L') return 3;
          if(ch=='U') return 1;
          else return 0;
      }
      public static boolean  dfs(int node,int parent, HashMap<Integer ,List<Integer>>map , boolean vis[] , boolean incircle[],List<Integer>list) {  
          if(incircle[node]) {
              return true;
          }
          if(vis[node]) return false;
          vis[node] = true;
          incircle[node] = true;
          boolean ans = false;
          for(int next : map.get(node) ) {
              if(next != parent) {
                  list.add(next);
                  ans = ans  || dfs(next,node,map,vis,incircle,list); 
                  if(!ans) {
                      list.remove(list.size()-1);
                  }
                  else return ans;
              }
              
          }
          incircle[node] = false;
          return ans;
      }
      public static int[] readarr()throws IOException {
          int n = sc.nextInt();
          int arr[] = new int[n];
          for(int i =0;i<n;i++) {
              arr[i] =  sc.nextInt();
          }
          return arr;
      }
   
      public static boolean isPowerOfTwo (long x) {
          return x!=0 && ((x&(x-1)) == 0);
      }
      public static boolean isPrime(long num) {
          if(num==1) return false;
          if(num<=3) return true;
          if(num%2==0||num%3==0) return false;
          for(long i =5;i*i<=num;i+=6) {
              if(num%i==0) return false;
          }
          return true;
      }
      public static boolean isPrime(int num) {
          if(num==1) return false;
          if(num<=3) return true;
          if(num%2==0||num%3==0) return false;
          for(int i =5;i*i<=num;i+=6) {
              if(num%i==0) return false;
          }
          return true;
      }
      public static long gcd(long a , long b) {
          if (b == 0) return a;
          return gcd(b, a % b);
      }
      public static long get_gcd(long a , long b) {
          if (b == 0) return a;
          return gcd(b, a % b);
      }
      public static long fac(long num)  {
          long ans = 1;
          int mod = (int)1e9+7;
          for(long i = 2;i<=num;i++) {
              ans  =  (ans*i)%mod;
          }
          return ans;
      }
  }
   
  