



'''simple docstring'''




from __future__ import annotations

import math


def 				lowerCAmelCase_   (	_lowerCamelCase:   int					):





		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 				lowerCAmelCase_   (	_lowerCamelCase:   int					):
		__SCREAMING_SNAKE_CASE       :		List[str]           =		str(A__					)
		__SCREAMING_SNAKE_CASE       :		Union[str, Any]           =		[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 				lowerCAmelCase_   (	_lowerCamelCase:   int					):





		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 				lowerCAmelCase_   (	_lowerCamelCase:   int = 11					):
		__SCREAMING_SNAKE_CASE       :		list[int]           =		[]
		__SCREAMING_SNAKE_CASE       :		Union[str, Any]           =		13
		while len(A__					) != count:
				if validate(A__					):
						__SCREAMING_SNAKE_CASE       :		Union[str, Any]           =		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 				lowerCAmelCase_   (	):
		return sum(compute_truncated_primes(11					)					)


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



'''simple docstring'''






from math import ceil







def 				UpperCamelCase_			(    A__					:   int = 10_01					):
  '''simple docstring'''





  lowerCAmelCase_			:      List[Any]			=   1

  for i in range(1							,    int(ceil(n / 2.0					)					)					):
    lowerCAmelCase_			:      int			=   2 * i + 1
    lowerCAmelCase_			:      Tuple			=   2 * i
    lowerCAmelCase_			:      Tuple			=   total + 4 * odd**2 - 6 * even

  return total


if __name__ == "__main__":
  import sys

  if len(sys.argv) == 1:
    print(solution())
  else:
    try:
      __A					:  str											=      int(sys.argv[1])
      print(solution(n))
    except ValueError:
      print("Invalid entry - please enter a number")



