output_description: If it is possible to construct a Haiku by using each of the phrases once,
  print `YES` (case-sensitive). Otherwise, print `NO`.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      A B C
attempt: #include <iostream>
  #include <math.h>
  #include <vector>
  #include <map>
  #include <stack>
  #include <queue>
  #include <set>
  #include <algorithm>
  #include <iomanip>
  #include <string.h>
  
  #define FOR(i,a,b) for(int i=(a);i<(b);++i)
  #define REP(i,n)  FOR(i,0,n)
  #define ALL(a)  (a).begin(),(a).end()
  
  typedef long long lint;
  
  using namespace std;
  
  int main(){
    int A[3];
    int B[3]={5,5,7};
    cin>>A[0]>>A[1]>>A[2];
    sort(A,A+3);
    if(memcmp(A,B,sizeof A))cout<<"NO"<<endl;
    else cout<<"YES"<<endl;
    return 0;
  }
  
problem_description: Statement
  
  Iroha loves _Haiku_. Haiku is a short form of Japanese poetry. A Haiku
  consists of three phrases with 5, 7 and 5 syllables, in this order.
  
  To create a Haiku, Iroha has come up with three different phrases. These
  phrases have A, B and C syllables, respectively. Determine whether she can
  construct a Haiku by using each of the phrases once, in some order.
samples: [{"input": "5 5 7", "output": "YES\n    \n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\n* * *"}, {"input": "7 7 5", "output": "NO"}]