






from math import sqrt

def   _lowerCamelCase						(    __A     :				Dict			)   ->       Any:
    assert isinstance(_UpperCamelCase		,		_UpperCamelCase			) and (
        number >= 0
    ), "'number' must been an int and positive"

    _UpperCAmelCase					:   Tuple      	=					True

    # 0 and 1 are none primes.
    if number <= 1:
        _UpperCAmelCase					:   Any      	=					False

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

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

    return status

def   _lowerCamelCase						(    __A     :				Union[str, Any]			)   ->       List[str]:
    assert isinstance(_UpperCamelCase		,		_UpperCamelCase			) and (n > 2), "'N' must been an int and > 2"

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

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

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

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

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

    return ans

def   _lowerCamelCase						(    __A     :				Union[str, Any]			)   ->       int:
    assert isinstance(_UpperCamelCase		,		_UpperCamelCase			) and (n > 2), "'N' must been an int and > 2"

    _UpperCAmelCase					:   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(_UpperCamelCase			):
            ans.append(_UpperCamelCase			)

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

    return ans

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

    _UpperCAmelCase					:   Tuple      	=					[]  # this list will be returns of the function.

    # potential prime number factors.

    _UpperCAmelCase					:   Any      	=					2

    _UpperCAmelCase					:   List[Any]      	=					number

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

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

    else:
        ans.append(_UpperCamelCase			)

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

    return ans

def   _lowerCamelCase						(    __A     :				Tuple			)   ->       Any:
    assert isinstance(_UpperCamelCase		,		_UpperCamelCase			) and (
        number >= 0
    ), "'number' bust been an int and >= 0"

    _UpperCAmelCase					:   Optional[Any]      	=					0

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

    _UpperCAmelCase					:   List[Any]      	=					max(_UpperCamelCase			)

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

    return ans

def   _lowerCamelCase						(    __A     :				Optional[Any]			)   ->       Union[str, Any]:
    assert isinstance(_UpperCamelCase		,		_UpperCamelCase			) and (
        number >= 0
    ), "'number' bust been an int and >= 0"

    _UpperCAmelCase					:   Any      	=					0

    # prime factorization of 'number'
    _UpperCAmelCase					:   Tuple      	=					prime_factorization(_UpperCamelCase			)

    _UpperCAmelCase					:   Tuple      	=					min(_UpperCamelCase			)

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

    return ans

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

    return number % 2 == 0

def   _lowerCamelCase						(    __A     :				Dict			)   ->       Union[str, Any]:
    assert isinstance(_UpperCamelCase		,		_UpperCamelCase			), "'number' must been an int"
    assert isinstance(number % 2 != 0		,		_UpperCamelCase			), "compare bust been from type bool"

    return number % 2 != 0

def   _lowerCamelCase						(    __A     :				int			)   ->       Dict:
    assert (
        isinstance(_UpperCamelCase		,		_UpperCamelCase			) and (number > 2) and is_even(_UpperCamelCase			)
    ), "'number' must been an int, even and > 2"

    _UpperCAmelCase					:   str      	=					[]  # this list will returned

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

    # run variable for while-loops.
    _UpperCAmelCase					:   Tuple      	=					0
    _UpperCAmelCase					:   Optional[int]      	=					None

    # exit variable. for break up the loops
    _UpperCAmelCase					:   Any      	=					True

    while i < len_pn and loop:
        _UpperCAmelCase					:   List[Any]      	=					i + 1

        while j < len_pn and loop:
            if prime_numbers[i] + prime_numbers[j] == number:
                _UpperCAmelCase					:   List[Any]      	=					False
                ans.append(prime_numbers[i]			)
                ans.append(prime_numbers[j]			)

            j += 1

        i += 1

    # precondition
    assert (
        isinstance(_UpperCamelCase		,		_UpperCamelCase			)
        and (len(_UpperCamelCase			) == 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						(    __A     :				Optional[Any]		,		__A     :				Optional[Any]			)   ->       Dict:
    assert (
        isinstance(_UpperCamelCase		,		_UpperCamelCase			)
        and isinstance(_UpperCamelCase		,		_UpperCamelCase			)
        and (numbera >= 0)
        and (numbera >= 0)
    ), "'number1' and 'number2' must been positive integer."

    _UpperCAmelCase					:   List[str]      	=					0

    while numbera != 0:
        _UpperCAmelCase					:   Union[str, Any]      	=					numbera % numbera
        _UpperCAmelCase					:   Optional[int]      	=					numbera
        _UpperCAmelCase					:   List[str]      	=					rest

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

    return numbera

def   _lowerCamelCase						(    __A     :				Tuple		,		__A     :				Optional[Any]			)   ->       Any:
    assert (
        isinstance(_UpperCamelCase		,		_UpperCamelCase			)
        and isinstance(_UpperCamelCase		,		_UpperCamelCase			)
        and (numbera >= 1)
        and (numbera >= 1)
    ), "'number1' and 'number2' must been positive integer."

    _UpperCAmelCase					:   Optional[Any]      	=					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'
        _UpperCAmelCase					:   Union[str, Any]      	=					prime_factorization(_UpperCamelCase			)
        _UpperCAmelCase					:   List[str]      	=					prime_factorization(_UpperCamelCase			)

    elif numbera == 1 or numbera == 1:
        _UpperCAmelCase					:   Dict      	=					[]
        _UpperCAmelCase					:   Optional[Any]      	=					[]
        _UpperCAmelCase					:   List[str]      	=					max(_UpperCamelCase		,		_UpperCamelCase			)

    _UpperCAmelCase					:   Optional[Any]      	=					0
    _UpperCAmelCase					:   Union[str, Any]      	=					0

    _UpperCAmelCase					:   int      	=					[]  # 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:
                _UpperCAmelCase					:   Any      	=					prime_fac_a.count(_UpperCamelCase			)
                _UpperCAmelCase					:   Tuple      	=					prime_fac_a.count(_UpperCamelCase			)

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

            else:
                _UpperCAmelCase					:   Optional[int]      	=					prime_fac_a.count(_UpperCamelCase			)

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

            done.append(_UpperCamelCase			)

        # iterates through primeFac2
    for n in prime_fac_a:
        if n not in done:
            _UpperCAmelCase					:   Any      	=					prime_fac_a.count(_UpperCamelCase			)

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

            done.append(_UpperCamelCase			)

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

    return ans

def   _lowerCamelCase						(    __A     :				Any			)   ->       Optional[int]:
    assert isinstance(_UpperCamelCase		,		_UpperCamelCase			) and (n >= 0), "'number' must been a positive int"

    _UpperCAmelCase					:   Tuple      	=					0
    _UpperCAmelCase					:   Dict      	=					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(_UpperCamelCase			):
            ans += 1

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

    return ans

def   _lowerCamelCase						(    __A     :				str		,		__A     :				Any			)   ->       List[str]:
    assert (
        is_prime(_UpperCamelCase			) and is_prime(_UpperCamelCase			) and (p_number_a < p_number_a)
    ), "The arguments must been prime numbers and 'pNumber1' < 'pNumber2'"

    _UpperCAmelCase					:   Dict      	=					p_number_a + 1  # jump to the next number

    _UpperCAmelCase					:   Optional[int]      	=					[]  # this list will be returns.

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

    while number < p_number_a:
        ans.append(_UpperCamelCase			)

        number += 1

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

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

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

def   _lowerCamelCase						(    __A     :				List[Any]			)   ->       Dict:
    assert isinstance(_UpperCamelCase		,		_UpperCamelCase			) and (n >= 1), "'n' must been int and >= 1"

    _UpperCAmelCase					:   Optional[Any]      	=					[]  # will be returned.

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

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

    return ans

def   _lowerCamelCase						(    __A     :				int			)   ->       List[str]:
    assert isinstance(_UpperCamelCase		,		_UpperCamelCase			) and (
        number > 1
    ), "'number' must been an int and >= 1"

    _UpperCAmelCase					:   Union[str, Any]      	=					get_divisors(_UpperCamelCase			)

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

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

def   _lowerCamelCase						(    __A     :				List[str]		,		__A     :				Dict			)   ->       int:
    assert (
        isinstance(_UpperCamelCase		,		_UpperCamelCase			)
        and isinstance(_UpperCamelCase		,		_UpperCamelCase			)
        and (denominator != 0)
    ), "The arguments must been from type int and 'denominator' != 0"

    # build the greatest common divisor of numerator and denominator.
    _UpperCAmelCase					:   Optional[int]      	=					gcd(abs(_UpperCamelCase			)		,		abs(_UpperCamelCase			)			)

    # precondition
    assert (
        isinstance(_UpperCamelCase		,		_UpperCamelCase			)
        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						(    __A     :				int			)   ->       Optional[Any]:
    assert isinstance(_UpperCamelCase		,		_UpperCamelCase			) and (n >= 0), "'n' must been a int and >= 0"

    _UpperCAmelCase					:   List[Any]      	=					1  # this will be return.

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

    return ans


def   _lowerCamelCase						(    __A     :				Union[str, Any]			)   ->       Optional[Any]:
    assert isinstance(_UpperCamelCase		,		_UpperCamelCase			) and (n >= 0), "'n' must been an int and >= 0"

    _UpperCAmelCase					:   Any      	=					0
    _UpperCAmelCase					:   Tuple      	=					1
    _UpperCAmelCase					:   List[str]      	=					1  # this will be return

    for _ in range(n - 1			):
        _UpperCAmelCase					:   int      	=					ans
        ans += fiba
        _UpperCAmelCase					:   Optional[int]      	=					tmp

    return ans






"""simple docstring"""




import unittest

from transformers import is_vision_available
from transformers.pipelines import pipeline
from transformers.testing_utils import (
    is_pipeline_test,
    nested_simplify,
    require_tf,
    require_torch,
    require_vision,
    slow,
)

from .test_pipelines_common import ANY


if is_vision_available():
  from PIL import Image
else:


  class       __magic_name__							:
         @staticmethod
         def 				lowercase_				(  *A_			,					**A_							)  ->						Optional[int]:





           """simple docstring"""




           pass


@is_pipeline_test
@require_vision
class       __magic_name__							(							unittest.TestCase			):
       @require_torch
       def 				lowercase_				(  self							)  ->						int:





         """simple docstring"""




         _lowercase:      Optional[Any]   			=  pipeline(
             model='''hf-internal-testing/tiny-random-clip-zero-shot-image-classification'''			,					)
         _lowercase:      List[Any]   			=  Image.open('''./tests/fixtures/tests_samples/COCO/000000039769.png'''							)
         _lowercase:      str   			=  image_classifier(A_			,					candidate_labels=['''a''', '''b''', '''c''']							)

         # The floating scores are so close, we enter floating error approximation and the order is not guaranteed across
         # python and torch versions.
         self.assertIn(
             nested_simplify(A_							)			,					[
                 [{'''score''': 0.3_33, '''label''': '''a'''}, {'''score''': 0.3_33, '''label''': '''b'''}, {'''score''': 0.3_33, '''label''': '''c'''}],
                 [{'''score''': 0.3_33, '''label''': '''a'''}, {'''score''': 0.3_33, '''label''': '''c'''}, {'''score''': 0.3_33, '''label''': '''b'''}],
             ]			,					)

         _lowercase:      Any   			=  image_classifier([image] * 5			,					candidate_labels=['''A''', '''B''', '''C''']			,					batch_size=2							)
         self.assertEqual(
             nested_simplify(A_							)			,					[
                 [
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                 ],
                 [
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                 ],
                 [
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                 ],
                 [
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                 ],
                 [
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                 ],
             ]			,					)
       @require_tf
       def 				lowercase_				(  self							)  ->						int:





         """simple docstring"""




         _lowercase:      Union[str, Any]   			=  pipeline(
             model='''hf-internal-testing/tiny-random-clip-zero-shot-image-classification'''			,					framework='''tf'''							)
         _lowercase:      List[str]   			=  Image.open('''./tests/fixtures/tests_samples/COCO/000000039769.png'''							)
         _lowercase:      Union[str, Any]   			=  image_classifier(A_			,					candidate_labels=['''a''', '''b''', '''c''']							)

         self.assertEqual(
             nested_simplify(A_							)			,					[{'''score''': 0.3_33, '''label''': '''a'''}, {'''score''': 0.3_33, '''label''': '''b'''}, {'''score''': 0.3_33, '''label''': '''c'''}]			,					)

         _lowercase:      List[str]   			=  image_classifier([image] * 5			,					candidate_labels=['''A''', '''B''', '''C''']			,					batch_size=2							)
         self.assertEqual(
             nested_simplify(A_							)			,					[
                 [
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                 ],
                 [
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                 ],
                 [
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                 ],
                 [
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                 ],
                 [
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                     {'''score''': 0.3_33, '''label''': ANY(A_							)},
                 ],
             ]			,					)
       @slow
       @require_torch
       def 				lowercase_				(  self							)  ->						Any:





         """simple docstring"""




         _lowercase:      Tuple   			=  pipeline(
             task='''zero-shot-image-classification'''			,					model='''openai/clip-vit-base-patch32'''			,					)
         # This is an image of 2 cats with remotes and no planes
         _lowercase:      str   			=  Image.open('''./tests/fixtures/tests_samples/COCO/000000039769.png'''							)
         _lowercase:      Optional[Any]   			=  image_classifier(A_			,					candidate_labels=['''cat''', '''plane''', '''remote''']							)

         self.assertEqual(
             nested_simplify(A_							)			,					[
                 {'''score''': 0.5_11, '''label''': '''remote'''},
                 {'''score''': 0.4_85, '''label''': '''cat'''},
                 {'''score''': 0.0_04, '''label''': '''plane'''},
             ]			,					)

         _lowercase:      Optional[Any]   			=  image_classifier([image] * 5			,					candidate_labels=['''cat''', '''plane''', '''remote''']			,					batch_size=2							)
         self.assertEqual(
             nested_simplify(A_							)			,					[
                 [
                     {'''score''': 0.5_11, '''label''': '''remote'''},
                     {'''score''': 0.4_85, '''label''': '''cat'''},
                     {'''score''': 0.0_04, '''label''': '''plane'''},
                 ],
             ]
             * 5			,					)



       @slow
       @require_tf
       def 				lowercase_				(  self							)  ->						Optional[Any]:





         """simple docstring"""




         _lowercase:      Tuple   			=  pipeline(
             task='''zero-shot-image-classification'''			,					model='''openai/clip-vit-base-patch32'''			,					framework='''tf'''							)
         # This is an image of 2 cats with remotes and no planes
         _lowercase:      str   			=  Image.open('''./tests/fixtures/tests_samples/COCO/000000039769.png'''							)
         _lowercase:      Optional[int]   			=  image_classifier(A_			,					candidate_labels=['''cat''', '''plane''', '''remote''']							)
         self.assertEqual(
             nested_simplify(A_							)			,					[
                 {'''score''': 0.5_11, '''label''': '''remote'''},
                 {'''score''': 0.4_85, '''label''': '''cat'''},
                 {'''score''': 0.0_04, '''label''': '''plane'''},
             ]			,					)

         _lowercase:      Optional[Any]   			=  image_classifier([image] * 5			,					candidate_labels=['''cat''', '''plane''', '''remote''']			,					batch_size=2							)
         self.assertEqual(
             nested_simplify(A_							)			,					[
                 [
                     {'''score''': 0.5_11, '''label''': '''remote'''},
                     {'''score''': 0.4_85, '''label''': '''cat'''},
                     {'''score''': 0.0_04, '''label''': '''plane'''},
                 ],
             ]
             * 5			,					)
