






from typing import TYPE_CHECKING

from ...file_utils import _LazyModule, is_torch_available
from ...utils import OptionalDependencyNotAvailable


A__			:    int         =				{
    'configuration_gpt_neox_japanese': ['GPT_NEOX_JAPANESE_PRETRAINED_CONFIG_ARCHIVE_MAP', 'GPTNeoXJapaneseConfig'],
    'tokenization_gpt_neox_japanese': ['GPTNeoXJapaneseTokenizer'],
}

try:
							if not is_torch_available():
														raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
							pass
else:
							A__			:    List[str]         =				[
							    'GPT_NEOX_JAPANESE_PRETRAINED_MODEL_ARCHIVE_LIST',
							    'GPTNeoXJapaneseForCausalLM',
							    'GPTNeoXJapaneseLayer',
							    'GPTNeoXJapaneseModel',
							    'GPTNeoXJapanesePreTrainedModel',
							]


if TYPE_CHECKING:
							from .configuration_gpt_neox_japanese import GPT_NEOX_JAPANESE_PRETRAINED_CONFIG_ARCHIVE_MAP, GPTNeoXJapaneseConfig
							from .tokenization_gpt_neox_japanese import GPTNeoXJapaneseTokenizer

							try:
														if not is_torch_available():
																					raise OptionalDependencyNotAvailable()
							except OptionalDependencyNotAvailable:
														pass
							else:
														from .modeling_gpt_neox_japanese import (
														    GPT_NEOX_JAPANESE_PRETRAINED_MODEL_ARCHIVE_LIST,
														    GPTNeoXJapaneseForCausalLM,
														    GPTNeoXJapaneseLayer,
														    GPTNeoXJapaneseModel,
														    GPTNeoXJapanesePreTrainedModel,
														)


else:
							import sys

							A__			:    List[str]         =				_LazyModule(__name__, globals()['__file__'], _import_structure, module_spec=__spec__)












from collections import defaultdict
from math import gcd






def 						a    (		lowerCamelCase_ = 150_0000       ):






				'''simple docstring'''
				lowercase__     				=    defaultdict(lowerCamelCase_       )
				lowercase__     				=    2
				while 2 * euclid_m * (euclid_m + 1) <= limit:
								for euclid_n in range((euclid_m % 2) + 1	,     lowerCamelCase_	,     2       ):
												if gcd(lowerCamelCase_	,     lowerCamelCase_       ) > 1:
																continue
												lowercase__     				=    2 * euclid_m * (euclid_m + euclid_n)
												for perimeter in range(lowerCamelCase_	,     limit + 1	,     lowerCamelCase_       ):
																frequencies[perimeter] += 1
								euclid_m += 1
				return sum(1 for frequency in frequencies.values() if frequency == 1       )


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




