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: #include <bits/stdc++.h>
  #pragma GCC optimize("Ofast")
  using namespace std;
  unsigned long long int bigMod(unsigned long long int b,
                                unsigned long long int p,
                                unsigned long long int m) {
    b = b % m;
    if (p == 0)
      return 1;
    else if (p % 2 == 0)
      return ((unsigned long long int)pow(bigMod(b, p / 2, m), 2)) % m;
    else
      return ((unsigned long long int)pow(bigMod(b, (p - 1) / 2, m), 2) * b) % m;
  }
  unsigned long long int nCr(unsigned long long int n, unsigned long long int r) {
    unsigned long long int ans = 1;
    if (r >= n - r) {
      for (unsigned long long int i = r + 1; i <= n; i++) {
        ans = ans * i;
      }
      for (unsigned long long int i = 1; i <= n - r; i++) {
        ans = ans / i;
      }
    } else {
      for (unsigned long long int i = n - r + 1; i <= n; i++) {
        ans = ans * i;
      }
      for (unsigned long long int i = 1; i <= r; i++) {
        ans = ans / i;
      }
    }
    return ans;
  }
  unsigned long long int fib(unsigned long long int a) {
    const long double root5 = sqrt(5);
    const long double root5plus1div2 = (root5 + 1) / 2;
    return round(pow(root5plus1div2, a) / root5);
  }
  unsigned long long int gcd(unsigned long long int a, unsigned long long int b) {
    if (b == 0)
      return a;
    else
      return gcd(b, a % b);
  }
  unsigned long long int lcm(unsigned long long int a, unsigned long long int b) {
    return ((a * b) / gcd(a, b));
  }
  bool isPrime(unsigned long long int a) {
    if (a % 2 == 0) return false;
    for (int i = 3; i <= sqrt(a); i += 2) {
      if (a % i == 0) return false;
    }
    return true;
  }
  bool isComposite(unsigned long long int a) {
    if (isPrime(a))
      return false;
    else
      return true;
  }
  bool coPrime(unsigned long long int a, unsigned long long int b) {
    if (gcd(a, b) == 1)
      return true;
    else
      return false;
  }
  long double toRadian(long double deg) { return (deg * acos(-1) / 180); }
  unsigned long long int strToInt(string a) {
    int len = a.length();
    int power = 0;
    unsigned long long int tot = 0;
    for (int i = len - 1; i >= 0; i--) {
      tot = tot + pow(10, power) * (a[i] - '0');
      power++;
    }
    return tot;
  }
  bool desc(int a, int b) { return a > b; }
  unsigned long long int mex(int* arr, int n) {
    sort(arr, arr + n);
    int now = -1;
    for (int i = 0; i < n; i++) {
      if (arr[i] == now + 1) {
        now++;
      } else if (arr[i] == now) {
      } else {
        return now + 1;
      }
    }
    return now + 1;
  }
  long long int euclid_ext(long long int a, long long int b, long long int* x,
                           long long int* y) {
    if (a == 0) {
      *x = 0;
      *y = 1;
      return b;
    }
    long long int sx, sy;
    long long int gcd = euclid_ext(b % a, a, &sx, &sy);
    *x = sy - (b / a) * sx;
    *y = sx;
    return gcd;
  }
  long long int modInv(long long int b, long long int m) {
    long long int x, y;
    long long int gcd = euclid_ext(b, m, &x, &y);
    if (gcd == -1) {
      return -1;
    } else {
      return (x % m + m) % m;
    }
  }
  long double slope(long double xdiff, long double ydiff) {
    return (ydiff / xdiff);
  }
  bool binSearch(long long int* arr, long long int n, long long int target) {
    unsigned long long int l = 0, r = n - 1;
    while (l < r) {
      int mid = (l + r) / 2;
      if (arr[mid] >= target) {
        r = mid;
      } else {
        l = mid + 1;
      }
    }
    if (arr[l] == target) {
      return true;
    } else {
      return false;
    }
  }
  int ascii(char x) { return int(x); }
  long double sine(long double x) { return sin(toRadian(x)); }
  long double cosine(long double x) { return cos(toRadian(x)); }
  long double tangent(long double x) { return tan(toRadian(x)); }
  unsigned long long int hammDist(string a, string b,
                                  unsigned long long int len) {
    unsigned long long int cnt = 0;
    for (int i = 0; i < len; i++) {
      if (a[i] != b[i]) cnt++;
    }
    return cnt;
  }
  unsigned long long int binStrToInt(string a, unsigned long long int len) {
    unsigned long long int num = 0;
    for (int i = len - 1; i >= 0; i--) {
      if (a[i] == '1') {
        num = num + pow((unsigned long long int)2, len - i - 1);
      }
    }
    return num;
  }
  const long long int maxn = 10;
  class fenwick {
    long long int arr[maxn] = {0};
    long long int n;
  
   public:
    void init(long long int);
    void update(int, long long int);
    long long int sum(int);
    int g(int);
    int h(int);
  };
  int fenwick::g(int a) { return (a & (a + 1)); }
  int fenwick::h(int a) { return (a | (a + 1)); }
  void fenwick::update(int pos, long long int ch) {
    for (; pos < n; pos = h(pos)) {
      arr[pos] += ch;
    }
  }
  long long int fenwick::sum(int pos) {
    long long int ans = 0;
    while (pos >= 0) {
      ans += arr[pos];
      pos = g(pos) - 1;
    }
    return ans;
  }
  void fenwick::init(long long int t) { n = t; }
  class dsu {
    int arr[maxn];
    int n;
  
   public:
    void merge(int, int);
    int get(int);
    void init(int);
  };
  void dsu::init(int a) {
    n = a;
    for (int i = 0; i < n; i++) arr[i] = i;
  }
  int dsu::get(int u) {
    if (u == arr[u])
      return u;
    else
      return arr[u] = get(arr[u]);
  }
  void dsu::merge(int u, int v) { arr[get(u)] = get(v); }
  void yes() { cout << "YES\n"; }
  void no() { cout << "NO\n"; }
  void solve() {
    int a, b, c;
    cin >> a >> b >> c;
    if (a == b + c || b == a + c || c == a + b)
      yes();
    else if ((a % 2 == 0 && b == c) || (b % 2 == 0 && a == c) ||
             (c % 2 == 0 && a == b))
      yes();
    else
      no();
  }
  int main() {
    cin.tie(NULL);
    cout.tie(NULL);
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--) solve();
  }
  