


'''simple docstring'''
from datetime import datetime

import matplotlib.pyplot as plt
import torch


def       a				(      __a       )  ->     Optional[Any]:



					'''simple docstring'''






					for param in module.parameters():
										UpperCamelCase__       :int							 =			False


def       a				(      )  ->     Any:



					'''simple docstring'''






					UpperCamelCase__       :Union[str, Any]							 =			'''cuda''' if torch.cuda.is_available() else '''cpu'''
					if torch.backends.mps.is_available() and torch.backends.mps.is_built():
										UpperCamelCase__       :Dict							 =			'''mps'''
					if device == "mps":
										print(
										    '''WARNING: MPS currently doesn\'t seem to work, and messes up backpropagation without any visible torch'''
										    ''' errors. I recommend using CUDA on a colab notebook or CPU instead if you\'re facing inexplicable issues'''
										    ''' with generations.'''       )
					return device


def       a				(      __a       )  ->     Dict:



					'''simple docstring'''






					UpperCamelCase__       :Any							 =			plt.imshow(__a       )
					fig.axes.get_xaxis().set_visible(__a       )
					fig.axes.get_yaxis().set_visible(__a       )
					plt.show()







def       a				(      )  ->     int:



					'''simple docstring'''






					UpperCamelCase__       :Any							 =			datetime.now()
					UpperCamelCase__       :List[str]							 =			current_time.strftime('''%H:%M:%S'''       )
					return timestamp



'''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)) = }""")