




"""simple docstring"""






def 							UpperCAmelCase		(		snake_case			:					int = 1000000    ):
					_lowerCAmelCase:str									=  limit + 1
					_lowerCAmelCase:Any									=  [0] * limit
					for first_term in range(1      ,       snake_case    ):
										for n in range(snake_case      ,       snake_case      ,       snake_case    ):
															_lowerCAmelCase:Dict									=  first_term + n / first_term
															if common_difference % 4:  # d must be divisble by 4
																				continue
															else:
																				common_difference /= 4
																				if (
																				    first_term > common_difference
																				    and first_term < 4 * common_difference
																				):  # since x,y,z are positive integers
																									frequency[n] += 1  # so z>0 and a>d ,also 4d<a

					_lowerCAmelCase:str									=  sum(1 for x in frequency[1:limit] if x == 10    )

					return count


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












"""simple docstring"""






from dataclasses import dataclass
from typing import List, Optional, Union

import numpy as np
import torch

from ...utils import BaseOutput, OptionalDependencyNotAvailable, is_torch_available, is_transformers_available




@dataclass
class   a__			(       UpperCamelCase_  ):
						snake_case__             = 42


try:
				if not (is_transformers_available() and is_torch_available()):
								raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
				from ...utils.dummy_torch_and_transformers_objects import *  # noqa F403
else:
				from .pipeline_text_to_video_synth import TextToVideoSDPipeline
				from .pipeline_text_to_video_synth_imgaimg import VideoToVideoSDPipeline  # noqa: F401
				from .pipeline_text_to_video_zero import TextToVideoZeroPipeline






