For this Question: There are three sticks with integer lengths l<sub>1</sub>, l<sub>2</sub> and l<sub>3</sub>. 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.The input consists of 3 space- separated integers l<sub>1</sub>, l<sub>2</sub> and l<sub>3</sub>.

<b>Constraints</b>
1 &le; l<sub>i</sub> &le; 10<sup>8</sup>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".<b>Sample Input 1</b>
6 1 5
<b>Sample Output 1</b>
Yes

<b>Sample Input 2</b>
2 5 2
<b>Sample Output 2</b>
No, I have written this Solution Code: 
#include <bits/stdc++.h>

using namespace std;

int main() {

  int tt=1;
//  cin >> tt;
  while (tt--) {
    int a, b, c;
    cin >> a >> b >> c;
    if (a == b + c || b == c + a || c == a + b) {
      cout << "Yes" << '\n';
    } else {
      if ((a == b && c % 2 == 0) || (a == c && b % 2 == 0) || (b == c && a % 2 == 0)) {
        cout << "Yes" << '\n';
      } else {
        cout << "No" << '\n';
      }
    }
  }
  return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?