



"""simple docstring"""





from typing import List

import datasets
from datasets.tasks import AudioClassification

from ..folder_based_builder import folder_based_builder


lowerCamelCase      =		datasets.utils.logging.get_logger(__name__)
class    lowercase__     (					folder_based_builder.FolderBasedBuilderConfig   ):







							'''simple docstring'''


							UpperCamelCase		=  None
							UpperCamelCase		=  None



class    lowercase__     (					folder_based_builder.FolderBasedBuilder   ):







							'''simple docstring'''


							UpperCamelCase		=  datasets.Audio()
							UpperCamelCase		=  "audio"
							UpperCamelCase		=  AudioFolderConfig
							UpperCamelCase		=  42  # definition at the bottom of the script
							UpperCamelCase		=  AudioClassification(audio_column='''audio'''       ,      label_column='''label'''   )



lowerCamelCase      =		[
    """.aiff""",
    """.au""",
    """.avr""",
    """.caf""",
    """.flac""",
    """.htk""",
    """.svx""",
    """.mat4""",
    """.mat5""",
    """.mpc2k""",
    """.ogg""",
    """.paf""",
    """.pvf""",
    """.raw""",
    """.rf64""",
    """.sd2""",
    """.sds""",
    """.ircam""",
    """.voc""",
    """.w64""",
    """.wav""",
    """.nist""",
    """.wavex""",
    """.wve""",
    """.xi""",
    """.mp3""",
    """.opus""",
]
lowerCamelCase      =		AUDIO_EXTENSIONS









"""simple docstring"""





from __future__ import annotations

import math
def      a__			(   lowerCAmelCase__   ):

      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(lowerCAmelCase__   ) + 1   )			,    6   ):
            if number % i == 0 or number % (i + 2) == 0:
                  return False
      return True


lowerCamelCase      =		[num for num in range(3, 100_001, 2) if not is_prime(num)]
def      a__			(   lowerCAmelCase__   ):
      if not isinstance(lowerCAmelCase__			,    lowerCAmelCase__   ):
            raise ValueError("n must be an integer"   )
      if n <= 0:
            raise ValueError("n must be >= 0"   )

      UpperCAmelCase_    				=							[]
      for num in range(len(lowerCAmelCase__   )   ):
            UpperCAmelCase_    				=							0
            while 2 * i * i <= odd_composites[num]:
                  UpperCAmelCase_    				=							odd_composites[num] - 2 * i * i
                  if is_prime(lowerCAmelCase__   ):
                        break
                  i += 1
            else:
                  list_nums.append(odd_composites[num]   )
                  if len(lowerCAmelCase__   ) == n:
                        return list_nums

      return []
def      a__			(   ):
      return compute_nums(1   )[0]


if __name__ == "__main__":
  print(F"{solution() = }")




