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>
  using namespace std;
  namespace sns {
  const long long INF = 1e18;
  const long long MOD = 998244353;
  namespace io {
  uint32_t curlev = 0;
  std::string os_sep[10] = {" ", " ", " ", " ", " ", " ", " ", " ", " ", " "};
  std::string os_end[10] = {"", "", "", "", "", "", "", "", "", ""};
  void set_default_sns_io() {
    for (long long i = 0; i < 10; i++) {
      os_sep[i] = " ";
      os_end[i] = "";
    }
  }
  struct osep {
    std::string data;
    uint32_t lev;
    osep(const std::string& data, uint32_t lev = 0) : data(data), lev(lev){};
    friend std::ostream& operator<<(std::ostream& os, const osep& sp) {
      os_sep[std::min(sp.lev, 9u)] = sp.data;
      return os;
    }
  };
  struct oend {
    std::string data;
    uint32_t lev;
    oend(const std::string& data, uint32_t lev = 0) : data(data), lev(lev){};
    friend std::ostream& operator<<(std::ostream& os, const oend& ed) {
      os_end[std::min(ed.lev, 9u)] = ed.data;
      return os;
    }
  };
  template <typename f_T, typename s_T>
  std::istream& operator>>(std::istream& is, std::pair<f_T, s_T>& p) {
    is >> p.first >> p.second;
    return is;
  }
  template <typename f_T, typename s_T>
  std::ostream& operator<<(std::ostream& os, const std::pair<f_T, s_T>& p) {
    ++curlev;
    os << p.first << os_sep[curlev - 1] << p.second << os_end[curlev - 1];
    --curlev;
    return os;
  }
  template <typename _T>
  std::istream& operator>>(std::istream& is, std::vector<_T>& v);
  template <typename _T>
  std::ostream& operator<<(std::ostream& os, const std::vector<_T>& v);
  template <typename _T>
  std::istream& operator>>(std::istream& is, std::set<_T>& st);
  template <typename _T>
  std::ostream& operator<<(std::ostream& os, const std::set<_T>& st);
  template <typename _T>
  std::istream& readContainer(std::istream& is, _T& cont) {
    for (auto& x : cont) is >> x;
    return is;
  }
  template <typename _T>
  std::ostream& printContainer(std::ostream& os, const _T& cont) {
    auto it = cont.begin();
    auto next_it = cont.begin();
    if (next_it != cont.end()) ++next_it;
    while (it != cont.end() && next_it != cont.end()) {
      ++curlev;
      os << *it << os_sep[curlev - 1];
      --curlev;
      it = next_it;
      ++next_it;
    }
    ++curlev;
    if (it != cont.end()) os << *it;
    os << os_end[curlev - 1];
    --curlev;
    return os;
  }
  template <typename _T>
  std::istream& operator>>(std::istream& is, std::vector<_T>& v) {
    return readContainer(is, v);
  }
  template <typename _T>
  std::ostream& operator<<(std::ostream& os, const std::vector<_T>& v) {
    return printContainer(os, v);
  }
  template <typename _T>
  std::istream& operator>>(std::istream& is, std::set<_T>& st) {
    return readContainer(is, st);
  }
  template <typename _T>
  std::ostream& operator<<(std::ostream& os, const std::set<_T>& st) {
    return printContainer(os, st);
  }
  void iofast() {
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);
  }
  }  // namespace io
  using namespace io;
  long long gcd(long long a, long long b) {
    if (b == 0) return a;
    return gcd(b, a % b);
  }
  uint32_t rnd() { return (rand() << 16) | rand(); }
  long long fpow(long long a, long long n, long long m = MOD) {
    if (n == 0) return 1;
    long long b = fpow(a, n / 2, m);
    b = (b * b) % m;
    if (n % 2 == 1) b = (b * a) % m;
    return b;
  }
  long long fact(long long n, long long m = MOD) {
    long long ans = 1;
    for (long long i = 2; i <= n; i++) ans = (ans * i) % m;
    return ans;
  }
  }  // namespace sns
  using namespace sns;
  void solve() {
    long long a, b, c;
    cin >> a >> b >> c;
    if (a > b) swap(a, b);
    if (b > c) swap(b, c);
    if (a > b) swap(a, b);
    if (c == a + b || a == b && c % 2 == 0 || b == c && a % 2 == 0)
      cout << "YES";
    else
      cout << "NO";
  }
  signed main() {
    sns::io::iofast();
    cout << std::fixed << std::setprecision(20);
    long long t = 1;
    cin >> t;
    for (long long i = 0; i < t; i++) {
      solve();
      cout << '\n';
    }
  }
  