output_description: If all the characters in S are different, print `yes` (case-sensitive);
  otherwise, print `no`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: from collections import defaultdict, Counter
  from itertools import product, groupby, count, permutations, combinations
  from math import pi, sqrt
  from collections import deque
  from bisect import bisect, bisect_left, bisect_right
  from string import ascii_lowercase
  from functools import lru_cache
  import sys
  
  sys.setrecursionlimit(10000)
  INF = float("inf")
  YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
  dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
  dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
  
  
  def inside(y, x, H, W):
      return 0 <= y < H and 0 <= x < W
  
  
  def ceil(a, b):
      return (a + b - 1) // b
  
  
  def main():
      S = input()
      if len(S) == len(set(S)):
          print(yes)
      else:
          print(no)
  
  
  if __name__ == "__main__":
      main()
  
problem_description: Statement
  
  You are given a string S consisting of lowercase English letters. Determine
  whether all the characters in S are different.
samples: [{"input": "uncopyrightable", "output": "yes\n    \n\n* * *"}, {"input": "different", "output": "no\n    \n\n* * *"}, {"input": "no", "output": "yes"}]