output_description: If S can be obtained by permuting `abc`, print `Yes`; otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: x, y, z = map(int, input().split())
  a = max(x, y, z)
  b = min(x, y, z)
  c = x + y + z - a - b
  if (a - b) % 2 == 0:
      d = (a - b) / 2
      if (a - c) % 2 == 0:
          print(int((a - c) / 2 + d))
      else:
          print(int((a - 1 - c) / 2 + d + 2))
  else:
      e = (a - b - 1) / 2
      if (a - c) % 2 == 0:
          print(int((a - c) / 2 + 2 + e))
      else:
          print(int((a - 1 - c) / 2 + 1 + e))
  
problem_description: Statement
  
  You are given a string S of length 3 consisting of `a`, `b` and `c`. Determine
  if S can be obtained by permuting `abc`.
samples: [{"input": "bac", "output": "Yes\n    \n\nSwapping the first and second characters in `bac` results in `abc`.\n\n* * *"}, {"input": "bab", "output": "No\n    \n\n* * *"}, {"input": "abc", "output": "Yes\n    \n\n* * *"}, {"input": "aaa", "output": "No"}]