def       __lowerCAmelCase      (						A_   : int					)    ->  int:
  if n == 1 or not isinstance(A_						,	A_					):
    return 0
  elif n == 2:
    return 1
  else:
    __UpperCAmelCase						    =       [0, 1]
    for i in range(2						,	n + 1					):
      sequence.append(sequence[i - 1] + sequence[i - 2]					)

    return sequence[n]




def       __lowerCAmelCase      (						A_   : int					)    ->  int:
  __UpperCAmelCase						    =       0
  __UpperCAmelCase						    =       2

  while digits < n:
    index += 1
    __UpperCAmelCase						    =       len(str(fibonacci(A_					)					)					)

  return index




def       __lowerCAmelCase      (						A_   : int = 10_00					)    ->  int:
  return fibonacci_digits_index(A_					)


if __name__ == "__main__":
       print(solution(int(str(input()).strip())))




def       __lowerCAmelCase      (						A_   : str					)    ->  bool:
  if not all(x.isalpha() for x in string					):
    raise ValueError("String must only contain alphabetic characters."					)

  __UpperCAmelCase						    =       sorted(string.lower()					)
  return len(A_					) == len(set(A_					)					)


if __name__ == "__main__":
       a_							=      input("""Enter a string """).strip()

       a_							=      is_isogram(input_str)
       print(F"{input_str} is {'an' if isogram else 'not an'} isogram.")



