


'''simple docstring'''





from __future__ import annotations

from collections import deque
from queue import Queue
from timeit import timeit

__lowerCamelCase       				=	{
    '''A''': ['''B''', '''C'''],
    '''B''': ['''A''', '''D''', '''E'''],
    '''C''': ['''A''', '''F'''],
    '''D''': ['''B'''],
    '''E''': ['''B''', '''F'''],
    '''F''': ['''C''', '''E'''],
}


def 					a__    (				UpperCamelCase_	:			dict,      UpperCamelCase_	:			str	):
   UpperCAmelCase__  :Tuple            =			{start}
   UpperCAmelCase__  :Any            =			[start]
   UpperCAmelCase__  :Queue            =			Queue()
   queue.put(UpperCamelCase_	)
   while not queue.empty():
      UpperCAmelCase__  :Dict            =			queue.get()
      for w in graph[v]:
         if w not in explored:
            explored.add(UpperCamelCase_	)
            result.append(UpperCamelCase_	)
            queue.put(UpperCamelCase_	)
   return result


def 					a__    (				UpperCamelCase_	:			dict,      UpperCamelCase_	:			str	):
   UpperCAmelCase__  :Tuple            =			{start}
   UpperCAmelCase__  :List[str]            =			[start]
   UpperCAmelCase__  :Tuple            =			deque([start]	)
   while queue:
      UpperCAmelCase__  :Dict            =			queue.popleft()
      for child in graph[v]:
         if child not in visited:
            visited.add(UpperCamelCase_	)
            result.append(UpperCamelCase_	)
            queue.append(UpperCamelCase_	)
   return result


def 					a__    (				UpperCamelCase_	:			str	):
   UpperCAmelCase__  :Optional[int]            =			F'''from __main__ import G, {name}'''
   UpperCAmelCase__  :Tuple            =			10_000
   UpperCAmelCase__  :Optional[Any]            =			timeit(F'''{name}(G, \'A\')''',      setup=UpperCamelCase_,      number=UpperCamelCase_	)
   print(F'''{name:<35} finished {number} runs in {res:.5f} seconds'''	)


if __name__ == "__main__":
    import doctest

    doctest.testmod()

    benchmark_function('''breadth_first_search''')
    benchmark_function('''breadth_first_search_with_deque''')
    # breadth_first_search                finished 10000 runs in 0.20999 seconds
    # breadth_first_search_with_deque     finished 10000 runs in 0.01421 seconds







'''simple docstring'''





def 					a__    (				UpperCamelCase_	:			int = 100	):
   UpperCAmelCase__  :List[str]            =			1
   UpperCAmelCase__  :Dict            =			0
   for i in range(1,      num + 1	):
      fact *= i

   for j in str(UpperCamelCase_	):
      result += int(UpperCamelCase_	)

   return result


if __name__ == "__main__":
    print(solution(int(input('''Enter the Number: ''').strip())))



