


import json
import os
from datetime import date
from pathlib import Path

from tabulate import DataRow, TableFormat, tabulate


_UpperCAmelCase			:  Tuple     =TableFormat(
    lineabove=None,
    linebelowheader=None,
    linebetweenrows=None,
    linebelow=None,
    headerrow=DataRow("""""", """|""", """|"""),
    datarow=DataRow("""""", """|""", """|"""),
    padding=1,
    with_header_hide=None,
)


_UpperCAmelCase			:  str     =[]
_UpperCAmelCase			:  int     =[]

_UpperCAmelCase			:  Any     ={"""type""": """section""", """text""": {"""type""": """plain_text""", """text""": """No failed tests! 🤗""", """emoji""": True}}

_UpperCAmelCase			:  Union[str, Any]     =[
    {
        """type""": """header""",
        """text""": {
            """type""": """plain_text""",
            """text""": f"""🤗 Accelerate nightly {os.environ.get('TEST_TYPE', '')} test results""",
            """emoji""": True,
        },
    }
]

_UpperCAmelCase			:  List[str]     =0
for log in Path().glob("""*.log"""):
						_UpperCAmelCase			:  List[str]     =0
						with open(log, """r""") as f:
												for line in f:
																		_UpperCAmelCase			:  str     =json.loads(line)
																		if line.get("""nodeid""", """""") != "":
																								_UpperCAmelCase			:  Optional[int]     =line["""nodeid"""]
																								if line.get("""duration""", None) is not None:
																														_UpperCAmelCase			:  Tuple     =f"""{line['duration']:.4f}"""
																														if line.get("""outcome""", """""") == "failed":
																																				section_num_failed += 1
																																				failed.append([test, duration, log.name.split("""_""")[0]])
																																				total_num_failed += 1
						group_info.append([str(log), section_num_failed, failed])
						_UpperCAmelCase			:  str     =[]
						log.unlink()

_UpperCAmelCase			:  Any     =""""""
_UpperCAmelCase			:  List[str]     =[]
if total_num_failed > 0:
						for name, num_failed, failed_tests in group_info:
												if num_failed > 0:
																		if num_failed == 1:
																								message += f"*{name[1:]}: {num_failed} failed test*\n"
																		else:
																								message += f"*{name[1:]}: {num_failed} failed tests*\n"
																		_UpperCAmelCase			:  int     =[]
																		_UpperCAmelCase			:  List[Any]     ={}
																		for test in failed_tests:
																								_UpperCAmelCase			:  str     =test[0].split("""::""")
																								_UpperCAmelCase			:  Any     =data[0].split("""/""")[-1]
																								if data[0] not in filesafailed:
																														_UpperCAmelCase			:  Optional[int]     =[data[1:]]
																								else:
																														filesafailed[data[0]] += [data[1:]]
																								failed_table.append(data)

																		_UpperCAmelCase			:  List[str]     =[test[0] for test in failed_table]
																		_UpperCAmelCase			:  Optional[Any]     =list(set(files))
																		# Count number of instances in failed_tests
																		_UpperCAmelCase			:  Dict     =[]
																		for file in individual_files:
																								table.append([file, len(filesafailed[file])])

																		_UpperCAmelCase			:  Tuple     =tabulate(
																		    table,
																		    headers=["""Test Location""", """Num Failed"""],
																		    tablefmt=hf_table_format,
																		    stralign="""right""",
																		)
																		message += f"\n```\n{failed_table}\n```"
																		all_filesafailed.append(filesafailed)
						if len(message) > 3000:
												_UpperCAmelCase			:  str     ="""Too many failed tests, please see the full report in the Action results."""
												_UpperCAmelCase			:  List[str]     =len(err) + 10
												_UpperCAmelCase			:  List[str]     =message[: 3000 - offset] + f"""\n...\n```\n{err}"""
						print(f"""### {message}""")
else:
						_UpperCAmelCase			:  Optional[Any]     ="""No failed tests! 🤗"""
						print(f"""## {message}""")
						payload.append(no_error_payload)

if os.environ.get("""TEST_TYPE""", """""") != "":
						from slack_sdk import WebClient

						_UpperCAmelCase			:  Any     =WebClient(token=os.environ["""SLACK_API_TOKEN"""])
						if message != "No failed tests! 🤗":
												_UpperCAmelCase			:  List[str]     ={
												    """type""": """section""",
												    """text""": {
												        """type""": """mrkdwn""",
												        """text""": message,
												    },
												}
												payload.append(md_report)
												_UpperCAmelCase			:  Tuple     ={
												    """type""": """section""",
												    """text""": {
												        """type""": """mrkdwn""",
												        """text""": """*For more details:*""",
												    },
												    """accessory""": {
												        """type""": """button""",
												        """text""": {
												            """type""": """plain_text""",
												            """text""": """Check Action results""",
												            """emoji""": True,
												        },
												        """url""": f"""https://github.com/{os.environ['GITHUB_REPOSITORY']}/actions/runs/{os.environ['GITHUB_RUN_ID']}""",
												    },
												}
												payload.append(action_button)
												_UpperCAmelCase			:  int     ={
												    """type""": """context""",
												    """elements""": [
												        {
												            """type""": """plain_text""",
												            """text""": f"""Nightly {os.environ.get('TEST_TYPE')} test results for {date.today()}""",
												        }
												    ],
												}
												payload.append(date_report)
						_UpperCAmelCase			:  List[str]     =client.chat_postMessage(channel="""#accelerate-ci-daily""", text=message, blocks=payload)
						_UpperCAmelCase			:  int     =response.data["""ts"""]
						for failed_file in all_filesafailed:
												for test_location, test_failures in failed_file.items():
																		# Keep only the first instance of the test name
																		_UpperCAmelCase			:  Optional[int]     =""""""
																		for i, row in enumerate(test_failures):
																								if row[0] != test_class:
																														_UpperCAmelCase			:  str     =row[0]
																								else:
																														_UpperCAmelCase			:  Union[str, Any]     =""""""

																		_UpperCAmelCase			:  int     ={
																		    """type""": """section""",
																		    """text""": {
																		        """type""": """mrkdwn""",
																		        """text""": f"""Test location: {test_location}\n```\n{tabulate(test_failures, headers=['Class', 'Test'], tablefmt=hf_table_format, stralign='right')}\n```""",
																		    },
																		}

																		client.chat_postMessage(
																		    channel="""#accelerate-ci-daily""",
																		    thread_ts=ts,
																		    blocks=[payload],
																		)



from math import sqrt



def 			lowerCAmelCase (		lowerCAmelCase_ )-> bool:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (
				    number >= 0
				), "'number' must been an int and positive"

				lowerCAmelCase_ :      str    				=				True

				# 0 and 1 are none primes.
				if number <= 1:
								lowerCAmelCase_ :      List[Any]    				=				False

				for divisor in range(2 ,   int(round(sqrt(lowerCAmelCase_ ) ) ) + 1 ):
								# if 'number' divisible by 'divisor' then sets 'status'
								# of false and break up the loop.
								if number % divisor == 0:
												lowerCAmelCase_ :      Any    				=				False
												break

    # precondition
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ), "'status' must been from type bool"

				return status



def 			lowerCAmelCase (		lowerCAmelCase_ )-> List[str]:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (n > 2), "'N' must been an int and > 2"

				# beginList: contains all natural numbers from 2 up to N
				lowerCAmelCase_ :      Optional[Any]    				=				list(range(2 ,   n + 1 ) )

				lowerCAmelCase_ :      List[Any]    				=				[]  # this list will be returns.

				# actual sieve of erathostenes
				for i in range(len(lowerCAmelCase_ ) ):
								for j in range(i + 1 ,   len(lowerCAmelCase_ ) ):
												if (begin_list[i] != 0) and (begin_list[j] % begin_list[i] == 0):
																lowerCAmelCase_ :      Tuple    				=				0

    # filters actual prime numbers.
				lowerCAmelCase_ :      List[str]    				=				[x for x in begin_list if x != 0]

				# precondition
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ), "'ans' must been from type list"

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> int:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (n > 2), "'N' must been an int and > 2"

				lowerCAmelCase_ :      List[str]    				=				[]

				# iterates over all numbers between 2 up to N+1
				# if a number is prime then appends to list 'ans'
				for number in range(2 ,   n + 1 ):
								if is_prime(lowerCAmelCase_ ):
												ans.append(lowerCAmelCase_ )

    # precondition
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ), "'ans' must been from type list"

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> Optional[Any]:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and number >= 0, "'number' must been an int and >= 0"

				lowerCAmelCase_ :      Union[str, Any]    				=				[]  # this list will be returns of the function.

				# potential prime number factors.

				lowerCAmelCase_ :      Any    				=				2

				lowerCAmelCase_ :      List[str]    				=				number

				if number == 0 or number == 1:
								ans.append(lowerCAmelCase_ )

				# if 'number' not prime then builds the prime factorization of 'number'
				elif not is_prime(lowerCAmelCase_ ):
								while quotient != 1:
												if is_prime(lowerCAmelCase_ ) and (quotient % factor == 0):
																ans.append(lowerCAmelCase_ )
																quotient /= factor
												else:
																factor += 1

				else:
								ans.append(lowerCAmelCase_ )

				# precondition
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ), "'ans' must been from type list"

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> List[Any]:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (
				    number >= 0
				), "'number' bust been an int and >= 0"

				lowerCAmelCase_ :      Union[str, Any]    				=				0

				# prime factorization of 'number'
				lowerCAmelCase_ :      Optional[int]    				=				prime_factorization(lowerCAmelCase_ )

				lowerCAmelCase_ :      Dict    				=				max(lowerCAmelCase_ )

				# precondition
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ), "'ans' must been from type int"

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> str:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (
				    number >= 0
				), "'number' bust been an int and >= 0"

				lowerCAmelCase_ :      Union[str, Any]    				=				0

				# prime factorization of 'number'
				lowerCAmelCase_ :      int    				=				prime_factorization(lowerCAmelCase_ )

				lowerCAmelCase_ :      Union[str, Any]    				=				min(lowerCAmelCase_ )

				# precondition
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ), "'ans' must been from type int"

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> Dict:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ), "'number' must been an int"
				assert isinstance(number % 2 == 0 ,   lowerCAmelCase_ ), "compare bust been from type bool"

				return number % 2 == 0



def 			lowerCAmelCase (		lowerCAmelCase_ )-> List[str]:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ), "'number' must been an int"
				assert isinstance(number % 2 != 0 ,   lowerCAmelCase_ ), "compare bust been from type bool"

				return number % 2 != 0



def 			lowerCAmelCase (		lowerCAmelCase_ )-> List[Any]:
				assert (
				    isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (number > 2) and is_even(lowerCAmelCase_ )
				), "'number' must been an int, even and > 2"

				lowerCAmelCase_ :      Union[str, Any]    				=				[]  # this list will returned

				# creates a list of prime numbers between 2 up to 'number'
				lowerCAmelCase_ :      List[Any]    				=				get_prime_numbers(lowerCAmelCase_ )
				lowerCAmelCase_ :      Any    				=				len(lowerCAmelCase_ )

				# run variable for while-loops.
				lowerCAmelCase_ :      List[Any]    				=				0
				lowerCAmelCase_ :      List[Any]    				=				None

				# exit variable. for break up the loops
				lowerCAmelCase_ :      int    				=				True

				while i < len_pn and loop:
								lowerCAmelCase_ :      Tuple    				=				i + 1

								while j < len_pn and loop:
												if prime_numbers[i] + prime_numbers[j] == number:
																lowerCAmelCase_ :      Union[str, Any]    				=				False
																ans.append(prime_numbers[i] )
																ans.append(prime_numbers[j] )

												j += 1

								i += 1

				# precondition
				assert (
				    isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and (len(lowerCAmelCase_ ) == 2)
				    and (ans[0] + ans[1] == number)
				    and is_prime(ans[0] )
				    and is_prime(ans[1] )
				), "'ans' must contains two primes. And sum of elements must been eq 'number'"

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ ,   lowerCAmelCase_ )-> Optional[int]:
				assert (
				    isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and (numbera >= 0)
				    and (numbera >= 0)
				), "'number1' and 'number2' must been positive integer."

				lowerCAmelCase_ :      List[str]    				=				0

				while numbera != 0:
								lowerCAmelCase_ :      int    				=				numbera % numbera
								lowerCAmelCase_ :      Union[str, Any]    				=				numbera
								lowerCAmelCase_ :      Tuple    				=				rest

				# precondition
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (
				    numbera >= 0
				), "'number' must been from type int and positive"

				return numbera



def 			lowerCAmelCase (		lowerCAmelCase_ ,   lowerCAmelCase_ )-> Any:
				assert (
				    isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and (numbera >= 1)
				    and (numbera >= 1)
				), "'number1' and 'number2' must been positive integer."

				lowerCAmelCase_ :      Dict    				=				1  # actual answer that will be return.

				# for kgV (x,1)
				if numbera > 1 and numbera > 1:
								# builds the prime factorization of 'number1' and 'number2'
								lowerCAmelCase_ :      Tuple    				=				prime_factorization(lowerCAmelCase_ )
								lowerCAmelCase_ :      str    				=				prime_factorization(lowerCAmelCase_ )

				elif numbera == 1 or numbera == 1:
								lowerCAmelCase_ :      List[Any]    				=				[]
								lowerCAmelCase_ :      List[Any]    				=				[]
								lowerCAmelCase_ :      str    				=				max(lowerCAmelCase_ ,   lowerCAmelCase_ )

				lowerCAmelCase_ :      str    				=				0
				lowerCAmelCase_ :      List[str]    				=				0

				lowerCAmelCase_ :      Any    				=				[]  # captured numbers int both 'primeFac1' and 'primeFac2'

				# iterates through primeFac1
				for n in prime_fac_a:
								if n not in done:
												if n in prime_fac_a:
																lowerCAmelCase_ :      str    				=				prime_fac_a.count(lowerCAmelCase_ )
																lowerCAmelCase_ :      List[str]    				=				prime_fac_a.count(lowerCAmelCase_ )

																for _ in range(max(lowerCAmelCase_ ,   lowerCAmelCase_ ) ):
																				ans *= n

												else:
																lowerCAmelCase_ :      Dict    				=				prime_fac_a.count(lowerCAmelCase_ )

																for _ in range(lowerCAmelCase_ ):
																				ans *= n

												done.append(lowerCAmelCase_ )

    # iterates through primeFac2
				for n in prime_fac_a:
								if n not in done:
												lowerCAmelCase_ :      Optional[int]    				=				prime_fac_a.count(lowerCAmelCase_ )

												for _ in range(lowerCAmelCase_ ):
																ans *= n

												done.append(lowerCAmelCase_ )

    # precondition
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (
				    ans >= 0
				), "'ans' must been from type int and positive"

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> Dict:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (n >= 0), "'number' must been a positive int"

				lowerCAmelCase_ :      Optional[int]    				=				0
				lowerCAmelCase_ :      Optional[int]    				=				2  # this variable holds the answer

				while index < n:
								index += 1

								ans += 1  # counts to the next number

								# if ans not prime then
								# runs to the next prime number.
								while not is_prime(lowerCAmelCase_ ):
												ans += 1

    # precondition
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and is_prime(
				    lowerCAmelCase_ ), "'ans' must been a prime number and from type int"

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ ,   lowerCAmelCase_ )-> Dict:
				assert (
				    is_prime(lowerCAmelCase_ ) and is_prime(lowerCAmelCase_ ) and (p_number_a < p_number_a)
				), "The arguments must been prime numbers and 'pNumber1' < 'pNumber2'"

				lowerCAmelCase_ :      str    				=				p_number_a + 1  # jump to the next number

				lowerCAmelCase_ :      Dict    				=				[]  # this list will be returns.

				# if number is not prime then
				# fetch the next prime number.
				while not is_prime(lowerCAmelCase_ ):
								number += 1

				while number < p_number_a:
								ans.append(lowerCAmelCase_ )

								number += 1

								# fetch the next prime number.
								while not is_prime(lowerCAmelCase_ ):
												number += 1

    # precondition
				assert (
				    isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and ans[0] != p_number_a
				    and ans[len(lowerCAmelCase_ ) - 1] != p_number_a
				), "'ans' must been a list without the arguments"

				# 'ans' contains not 'pNumber1' and 'pNumber2' !
				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> List[str]:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (n >= 1), "'n' must been int and >= 1"

				lowerCAmelCase_ :      List[str]    				=				[]  # will be returned.

				for divisor in range(1 ,   n + 1 ):
								if n % divisor == 0:
												ans.append(lowerCAmelCase_ )

    # precondition
				assert ans[0] == 1 and ans[len(lowerCAmelCase_ ) - 1] == n, "Error in function getDivisiors(...)"

				return ans



def 			lowerCAmelCase (		lowerCAmelCase_ )-> List[Any]:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (
				    number > 1
				), "'number' must been an int and >= 1"

				lowerCAmelCase_ :      Tuple    				=				get_divisors(lowerCAmelCase_ )

				# precondition
				assert (
				    isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and (divisors[0] == 1)
				    and (divisors[len(lowerCAmelCase_ ) - 1] == number)
				), "Error in help-function getDivisiors(...)"

				# summed all divisors up to 'number' (exclusive), hence [:-1]
				return sum(divisors[:-1] ) == number



def 			lowerCAmelCase (		lowerCAmelCase_ ,   lowerCAmelCase_ )-> Any:
				assert (
				    isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and (denominator != 0)
				), "The arguments must been from type int and 'denominator' != 0"

				# build the greatest common divisor of numerator and denominator.
				lowerCAmelCase_ :      List[str]    				=				gcd(abs(lowerCAmelCase_ ) ,   abs(lowerCAmelCase_ ) )

				# precondition
				assert (
				    isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ )
				    and (numerator % gcd_of_fraction == 0)
				    and (denominator % gcd_of_fraction == 0)
				), "Error in function gcd(...,...)"

				return (numerator // gcd_of_fraction, denominator // gcd_of_fraction)



def 			lowerCAmelCase (		lowerCAmelCase_ )-> List[Any]:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (n >= 0), "'n' must been a int and >= 0"

				lowerCAmelCase_ :      Tuple    				=				1  # this will be return.

				for factor in range(1 ,   n + 1 ):
								ans *= factor

				return ans




def 			lowerCAmelCase (		lowerCAmelCase_ )-> Tuple:
				assert isinstance(lowerCAmelCase_ ,   lowerCAmelCase_ ) and (n >= 0), "'n' must been an int and >= 0"

				lowerCAmelCase_ :      Tuple    				=				0
				lowerCAmelCase_ :      Optional[Any]    				=				1
				lowerCAmelCase_ :      Tuple    				=				1  # this will be return

				for _ in range(n - 1 ):
								lowerCAmelCase_ :      Any    				=				ans
								ans += fiba
								lowerCAmelCase_ :      Dict    				=				tmp

				return ans