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.
2
1 2 3
2 2 4
 1
1 98 99
 3
1 1 1
2 1 3
5 6 7
 6
2 2 4
1 1 2
3 5 6
1 2 3
6 7 8
10 10 20
 4
6 1 5
2 5 2
2 4 2
7 101 108
 1
100000 100000 100000
 1
12344 1 1
 68
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
1 1 2
 2
1 2 3
4 5 6

YES
YES
 YES
 NO
YES
NO
 YES
YES
NO
YES
NO
YES
 YES
NO
YES
YES
 YES
 YES
 YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
 YES
NO

import java.util.*;
import java.io.*;
  public class  Codechef{
  static final int  mod = (int)(1e9 + 7);
  static final FastReader sc = new FastReader();

public static void main(String[] args) {
   
   int t  = sc.nextInt();
   while(t-- > 0){
    int a = sc.nextInt();
    int b = sc.nextInt();
    int c = sc.nextInt();

    if( (a + b + c) % 2 == 0){
      boolean flag = false;
      if(a == (b + c)){
        flag = true;
      }
      else if(b == (a + c) ){
        flag = true;
      }
      else if(c == (a + b) ){
        flag = true;
      }
      else if(a == b && c % 2 == 0){
        flag = true;
      }
      else if(a == c && b % 2 == 0){
        flag = true;
      }
      else if(b == c && a % 2 == 0){
        flag = true;
      }

      if(flag){
        System.out.println("Yes");
      }
      else{
        System.out.println("No");
      }
    }
    else{
      System.out.println("No");
    }
   }
}
  









































  static class DSU{
      int[] parent, rank;
      public DSU(int v){
        parent = new int[v];
        rank = new int[v];
        for(int i=0; i<v; i++){
          parent[i] = -1;
          rank[i] = 1;
        }
      }
      int findParent(int u){
        if(parent[u] == -1) return u;
        parent[u] = findParent(parent[u]);
        return parent[u];
      }
      void union(int u, int v){
          u = findParent(u);
          v = findParent(v);
          if(u == v) return;
          if(rank[u] < rank[v]){
            parent[u] = v;
            rank[v] += rank[u];
          }
          else{
            parent[v] = u;
            rank[u] += v;
          }
      }
  }
  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()); 
        }
        char nextChar(){
          return next().charAt(0);
        }
 
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        }
        void print( char output){
          System.out.print(output + " ");
        }
        void print( int output){
          System.out.print(output + " ");
        }
 
        void print( long output){
          System.out.print(output + " ");
        }
 
        void print( double output){
          System.out.print(output + " ");
        }
        void print(String output){
          System.out.print(output);
        }
        void print(StringBuilder output){
          System.out.print(output);
        }
 
        void println( char output){
          System.out.println(output);
        }
        void println( int output){
          System.out.println(output);
        }
        void println( long output){
          System.out.println(output);
        }
        void println(double output){
          System.out.println(output);
        }
        void println(String output){
          System.out.println(output);
        }
        void println(StringBuilder output){
          System.out.println(output);
        }
 
         void printArray(char arr[]){
          StringBuilder str = new StringBuilder();
          int n = arr.length;
          for(int i=0; i<n; i++){
            str.append(arr[i]+" ");
          }
          System.out.println(str);
        }
        void printArray(int arr[]){
          StringBuilder str = new StringBuilder();
          int n = arr.length;
          for(int i=0; i<n; i++){
            str.append(arr[i]+" ");
          }
          System.out.println(str);
        }
        void printArray(Integer arr[]){
          StringBuilder str = new StringBuilder();
          int n = arr.length;
          for(int i=0; i<n; i++){
            str.append(arr[i]+" ");
          }
          System.out.println(str);
        }
        void printArray(boolean arr[]){
          StringBuilder str = new StringBuilder();
          int n = arr.length;
          for(int i=0; i<n; i++){
            str.append(arr[i]+" ");
          }
          System.out.println(str);
        }
         void printArray(int arr[], int fromIndex){
          StringBuilder str = new StringBuilder();
          int n = arr.length;
          for(int i=fromIndex; i<n; i++){
            str.append(arr[i]+" ");
          }
          System.out.println(str);
        }
 
       
        void printArray(long arr[]){
          StringBuilder str = new StringBuilder();
          int n = arr.length;
          for(int i=0; i<n; i++){
            str.append(arr[i]+" ");
          }
          System.out.println(str);
        }
        void printArray(double arr[]){
          StringBuilder str = new StringBuilder();
          int n = arr.length;
          for(int i=0; i<n; i++){
            str.append(arr[i]+" ");
          }
          System.out.println(str);
        } 
        void printArray(int arr[][]){
          StringBuilder str = new StringBuilder();
          int n = arr.length;
          int m = arr[0].length;
          for(int i=0; i<n; i++){
            for(int j = 0; j<m; j++){
              str.append(arr[i][j]+" ");
            }
            str.append("\n");
          }
          System.out.println(str);
        }
         void printArray(long arr[][]){
          StringBuilder str = new StringBuilder();
          int n = arr.length;
          int m = arr[0].length;
          for(int i=0; i<n; i++){
            for(int j = 0; j<m; j++){
              str.append(arr[i][j]+" ");
            }
            str.append("\n");
          }
          System.out.println(str);
        }
        void printArray(double arr[][]){
          StringBuilder str = new StringBuilder();
          int n = arr.length;
          int m = arr[0].length;
          for(int i=0; i<n; i++){
            for(int j = 0; j<m; j++){
              str.append(arr[i][j]+" ");
            }
            str.append("\n");
          }
          System.out.println(str);
        }
        void printGraph(List<List<Integer>> G){
          int nodes = G.size();
          for(int i=0; i<nodes; i++){
            System.out.print(i+"-> ");
              for(int j : G.get(i)){
                 System.out.print(j+" ");
              }
          System.out.println();
          }
        }
        static long pow(long base, int p, int mod){
          if(p == 0)
            return 1;
          long m = (base * base ) % mod;
 
          if(p % 2 == 0){
            return pow(m, p/2, mod) % mod;
          }
          else
            return (base % mod  * pow(m , p/2, mod) % mod ) % mod ;
        }
          
        static long pow(long base, long p){
          if(p == 0)
            return 1;
          long product = base * base % mod ;
 
          if(p % 2 == 0){
            return pow(product, p/2) % mod;
          }
          else
            return ( base  * ( pow(product , p/2) % mod ) ) % mod  ;
        }
        static long inverse(long a, long mod){
              return sc.pow(a, mod - 2);
        }
         static long inverse(long a){
              return sc.pow(a, mod - 2);
        }
        static int max(int arr[]){
            int len = arr.length;
            int max = Integer.MIN_VALUE;
            for(int i=0; i<len; i++){
                if( max < arr[i]){
                    max = arr[i];
                }
            }
            return max;
        }
     
        static int[] inputArray(int n){
          int arr[] = new int[n];
          for(int i=0; i<n; i++){
            arr[i] = sc.nextInt();
          }
          return arr;
        }
         static int[] inputArray(int n, int fromIndex){
          int size =  n + fromIndex;
          int arr[] = new int[size];
          for(int i=fromIndex; i<size; i++){
            arr[i] = sc.nextInt();
          }
          return arr;
        }
        static long[] inputArray(long n){
          long arr[] = new long[(int)n];
          for(int i=0; i<n; i++){
            arr[i] = sc.nextLong();
          }
          return arr;
        }
        static long[] inputArray(long n, int fromIndex){
          int size = (int)n + fromIndex;
          long arr[] = new long[size];
          for(int i=fromIndex; i<size; i++){
            arr[i] = sc.nextLong();
          }
          return arr;
        }
        static double[] inputArray(double n, int fromIndex){
          int size = (int)n + fromIndex;
          double arr[] = new double[size];
          for(int i=fromIndex; i<size; i++){
            arr[i] = sc.nextDouble();
          }
          return arr;
        }
        static List<Integer> findPrimes(int n){
                int sieve[] = new int[n+1];
                for(long  i = 2;  i<= n; i++){
                  if(sieve[(int)i] == 0){
                    for(long j = i*i; j <= n; j += i){
                      sieve[(int)j] = 1;
                    } 
                  }
                }
                List<Integer> primes = new ArrayList<>();
                  for(int i=2; i<=n ; i++){
                    if(sieve[i] == 0){
                      primes.add(i);
                    }
                  }
                  return primes;
              }
  }
}