






'''simple docstring'''
def       a				(      __a       )  ->     int:



					'''simple docstring'''






					assert (
					    isinstance(__a			, __a       ) and number_of_steps > 0
					), f'''number_of_steps needs to be positive integer, your input {number_of_steps}'''
					if number_of_steps == 1:
										return 1
					UpperCamelCase__       :List[str]							 =			1, 1
					for _ in range(number_of_steps - 1       ):
										UpperCamelCase__       :Any							 =			current + previous, current
					return current


if __name__ == "__main__":
		import doctest

		doctest.testmod()



'''simple docstring'''
from __future__ import annotations

import math


def       a				(      __a       )  ->     bool:



					'''simple docstring'''






					if 1 < number < 4:
										# 2 and 3 are primes
										return True
					elif number < 2 or number % 2 == 0 or number % 3 == 0:
										# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
										return False

					# All primes number are in format of 6k +/- 1
					for i in range(5			, int(math.sqrt(__a       ) + 1       )			, 6       ):
										if number % i == 0 or number % (i + 2) == 0:
															return False
					return True


def       a				(      __a       )  ->     list[int]:



					'''simple docstring'''






					UpperCamelCase__       :List[Any]							 =			str(__a       )
					UpperCamelCase__       :Dict							 =			[n]
					for i in range(1			, len(__a       )       ):
										list_nums.append(int(str_num[i:]       )       )
										list_nums.append(int(str_num[:-i]       )       )
					return list_nums


def       a				(      __a       )  ->     bool:



					'''simple docstring'''






					if len(str(__a       )       ) > 3:
										if not is_prime(int(str(__a       )[-3:]       )       ) or not is_prime(int(str(__a       )[:3]       )       ):
															return False
					return True


def       a				(      __a = 11       )  ->     list[int]:



					'''simple docstring'''






					UpperCamelCase__       :list[int]							 =			[]
					UpperCamelCase__       :int							 =			13
					while len(__a       ) != count:
										if validate(__a       ):
															UpperCamelCase__       :Optional[int]							 =			list_truncated_nums(__a       )
															if all(is_prime(__a       ) for i in list_nums       ):
																				list_truncated_primes.append(__a       )
										num += 2
					return list_truncated_primes


def       a				(      )  ->     int:



					'''simple docstring'''






					return sum(compute_truncated_primes(11       )       )


if __name__ == "__main__":
		print(F"""{sum(compute_truncated_primes(11)) = }""")