





import math
import os

import cva
import numpy as np

_SCREAMING_SNAKE_CASE   						=		2_5_5.0


def 				SCREAMING_SNAKE_CASE__    (     __a ,			__a ):
	snake_case_		:      Optional[Any]           =						np.mean((original - contrast) ** 2 )
	if mse == 0:
		return 1_00

	return 20 * math.logaa(PIXEL_MAX / math.sqrt(__a ) )


def 				SCREAMING_SNAKE_CASE__    (     ):
	snake_case_		:      Any           =						os.path.dirname(os.path.realpath(__a ) )
	# Loading images (original image and compressed image)
	snake_case_		:      int           =						cva.imread(os.path.join(__a ,			'image_data/original_image.png' ) )
	snake_case_		:      Tuple           =						cva.imread(os.path.join(__a ,			'image_data/compressed_image.png' ) ,			1 )

	snake_case_		:      Dict           =						cva.imread(os.path.join(__a ,			'image_data/PSNR-example-base.png' ) )
	snake_case_		:      Optional[Any]           =						cva.imread(
	    os.path.join(__a ,			'image_data/PSNR-example-comp-10.jpg' ) ,			1 )

	# Value expected: 29.73dB
	print('-- First Test --' )
	print(f"""PSNR value is {peak_signal_to_noise_ratio(__a ,			__a )} dB""" )

	# # Value expected: 31.53dB (Wikipedia Example)
	print('\n-- Second Test --' )
	print(f"""PSNR value is {peak_signal_to_noise_ratio(__a ,			__a )} dB""" )


if __name__ == "__main__":
						main()






def 				A      (	_UpperCAmelCase							:  List[Any]       )							->					List[Any]:







			'''simple docstring'''
			_UpperCAmelCase									=  len(_UpperCAmelCase       )
			for _ in range(
			    0				,  int(((no_of_elements - 1) / 2) + 1       )       ):  # we don't need to traverse to end of list as
						for j in range(0				,  no_of_elements - 1       ):
									if (
									    lst[j + 1] < lst[j]
									):  # applying bubble sort algorithm from left to right (or forwards)
												_UpperCAmelCase									=  lst[j + 1]
												_UpperCAmelCase									=  lst[j]
												_UpperCAmelCase									=  temp
									if (
									    lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
									):  # applying bubble sort algorithm from right to left (or backwards)
												_UpperCAmelCase									=  lst[no_of_elements - 1 - j]
												_UpperCAmelCase									=  lst[no_of_elements - 2 - j]
												_UpperCAmelCase									=  temp
			return lst


if __name__ == "__main__":
							print("enter the list to be sorted")
							UpperCAmelCase__  =			[int(x) for x in input().split()]  # inputing elements of the list in one line
							UpperCAmelCase__  =			double_sort(lst)
							print("the sorted list is")
							print(sorted_lst)
