You've got a rectangular parallelepiped with integer edge lengths. You know the areas of its three faces that have a common vertex. Your task is to find the sum of lengths of all 12 edges of this parallelepiped.
The first and the single line contains three space-separated integers — the areas of the parallelepiped's faces. The area's values are positive ( &gt; 0) and do not exceed 10<sup class="upper-index">4</sup>. It is guaranteed that there exists at least one parallelepiped that satisfies the problem statement.

# def dist(p1, p2):
	# return abs(p1[0]-p2[0]) + abs(p1[1]-p2[1])

from random import randint, shuffle
n = int(input())


choices = list(range(1,n+1))
shuffle(choices)
str_list = []
for i in range(1,n+1):
	str_list.append((str(i)) + " ")
print(''.join(str_list))

from sys import exit
exit()

# if( n == 1):
# 	print(1)
# 	from sys import exit
# 	exit()

# pnts = []
# # n=
# for i in range(n):
# 	x,y = [int(i) for i in input().split(" ")]
# 	# x = randint(0, 1000000)
# 	# x=i
# 	# y=i
# 	# y = randint(0, 1000000)
# 	pnts.append((x,y,i+1))

# from random import randint


# ind_list = []


# pCurr = pnts[0]
# n-=1
# del pnts[0]
# ind_list.append(str(pCurr[2]) + " ")

# while n >= 2: 
# 	i1 = randint(0,n-1)
# 	p1 = pnts[i1]
# 	while True:
# 		i2 = randint(0,n-1)
# 		p2 = pnts[i2]
# 		if p2[2] != p1[2]:
# 			break
# 	# while True:
# 	# 	p3 = randint(0,n-1)
# 	# 	if p3[2] != p2[2] and p3[2] != p1[2]:
# 	# 		break

# 	dist1 = dist(pCurr, p1)
# 	dist2 = dist(pCurr, p2)
# 	# print(pCurr, p1, dist1)
# 	# print(pCurr, p2, dist2)
# 	if dist1 < dist2:
# 		pCurr = p1
# 		i = i1
# 		# print('Chose dist1')
# 	else:
# 		pCurr = p2
# 		i = i2
# 		# print('chose dist2')

# 	n-=1
# 	# print(pnts, len(pnts), i)
# 	del pnts[i]
# 	ind_list.append(str(pCurr[2]) + " ")
# 	# print('deleting', pCurr[2])

# pCurr = pnts[0]
# # n-=1
# # del pnts[pCurr[2]]
# ind_list.append(str(pCurr[2]) + " ")
# print(''.join(ind_list))




# # str_list = []
# # for p in pnts_xy:
# 	# str_list.append(str(p[2]+1) + " ")
# # print(''.join(str_list))
		  	    	   					   	 				 	