$\text{A}$ 


-----Input-----

The input contains a single floating-point number x with exactly 6 decimal places (0 < x < 5).


-----Output-----

Output two integers separated by a single space. Each integer should be between 1 and 10, inclusive. If several solutions exist, output any of them. Solution will exist for all tests.


-----Examples-----
Input
1.200000

Output
3 2

Input
2.572479

Output
10 3

Input
4.024922

Output
9 9

Source: codeforces | Difficulty: MEDIUM_HARD


Solutions:
from math import sqrt
eps = 1e-05

def check(a, h, x):
	return abs(x * sqrt(4 * h * h + a * a) - a * h) < eps

def main():
	x = float(input())
	for a in range(1, 11):
		for h in range(1, 11):
			if check(a, h, x):
				print(a, h)
				return
main()


k = float(input())
eps = 10 ** (-5)
for x in range(1, 11):
	for y in range(1, 11):
		if abs(x ** 2 * y ** 2 / (x ** 2 + 4 * y ** 2) - k ** 2) < eps:
			print(x, y)
			break
	else:
		continue
	break


import sys
from math import sqrt, pi
X = float(input())

def rad_len(a, h, c):
	x = c * a / 2
	y = c * h
	return sqrt((x - a / 2) ** 2 + (y - 0) ** 2)

def get_max_radius(a, h):
	lo = 0.0
	hi = 1.0
	while abs(lo - hi) > 1e-09:
		p = lo + (hi - lo) / 3
		q = lo + 2 * (hi - lo) / 3
		if rad_len(a, h, p) > rad_len(a, h, q):
			lo = p
		else:
			hi = q
	return rad_len(a, h, lo)
for i in range(9, -1, -1):
	for ai in range(1, 11):
		for hi in range(1, 11):
			a = float(ai)
			h = float(hi)
			r = get_max_radius(a, h)
			if abs(r - X) < 10 ** (-i):
				print(ai, hi)
				sys.exit(0)


import sys
x = float(sys.stdin.readline())
diff = x
for a in range(1, 11):
	for h in range(1, 11):
		t = pow(a * a * h * h / (a * a + 4 * h * h), 0.5)
		if diff > abs(x - t):
			diff = abs(x - t)
			ans_a = a
			ans_h = h
print(ans_a, ans_h)


x = float(input())
for a in range(1, 10 + 1):
	for h in range(1, 10 + 1):
		if abs(x - (4 / (a * a) + 1 / (h * h)) ** (-0.5)) <= 10 ** (-5):
			print(a, h)
			quit()


class InputHandlerObject(object):
	inputs = []

	def getInput(self, n=0):
		res = ''
		inputs = self.inputs
		if not inputs:
			inputs.extend(input().split(' '))
		if n == 0:
			res = inputs[:]
			inputs[:] = []
		while n > len(inputs):
			inputs.extend(input().split(' '))
		if n > 0:
			res = inputs[:n]
			inputs[:n] = []
		return res
InputHandler = InputHandlerObject()
g = InputHandler.getInput
res = float(input())
found = False
for a in range(1, 11):
	for h in range(1, 11):
		if found:
			break
		n = a / 2
		ypluszsquared = n ** 2 + h ** 2
		yminuszsquared = (n ** 2 - h ** 2) ** 2 / ypluszsquared
		fouryz = ypluszsquared - yminuszsquared
		x = (fouryz / 4) ** 0.5
		if abs(res - x) < 1e-05:
			print(a, h)
			found = True


import math as m
x = float(input())
for a in range(1, 10 + 1):
	for h in range(1, 10 + 1):
		if abs(x - a * h / (2 * m.sqrt(a * a / 4 + h * h))) <= 10 ** (-5):
			print(a, h)
			quit()


from math import *
r = float(input())
for a in range(1, 11):
	for h in range(1, 11):
		R = a * a * h * 0.5 / sqrt(h * h + a * a / 4) / a
		if abs(R - r) < 1e-05:
			print(a, h)
			exit()


from math import sqrt
d = 1e-05
r = float(input())
for a in range(1, 11):
	for h in range(1, 11):
		if abs(h * a / 2 / sqrt(h ** 2 + (a / 2) ** 2) - r) <= d:
			ans_a = a
			ans_h = h
print(ans_a, ans_h)


import math

def getR(a, h):
	return math.sin(math.atan2(h, 0.5 * a)) * 0.5 * a
r = float(input())
bestR = 1e+100
for a in range(1, 11):
	for h in range(1, 11):
		d = abs(r - getR(a, h))
		if d < bestR:
			bestR = d
			bestA = a
			bestH = h
print(bestA, bestH)


from math import hypot
__author__ = 'Pavel Mavrin'
rr = float(input())
min = 1e+100
res = []
for a in range(1, 11):
	for h in range(1, 11):
		x = a / 2
		y = h
		r = x * y / hypot(x, y)
		d = abs(r - rr)
		if d < min:
			min = d
			res = [a, h]
print(*res)


import math
s = input()
r = float(s)

def okrugl(fl):
	return round(fl * 1000000) / 1000000
flag = 1
for a in range(1, 11):
	for h in range(1, 11):
		if okrugl(a * h / math.sqrt(a * a + h * h * 4)) == r:
			if flag:
				print(a, ' ', h)
				flag = 0


r = float(input())
a = 0
h = 0
for i in range(1, 11):
	for j in range(1, 11):
		c = pow(j * j + i * i / 4.0, 0.5)
		rtest = i * j * 0.5 / c
		if abs(rtest - r) < 1e-05:
			a = i
			h = j
print(a, h)


from math import sqrt
import sys
x = float(input())
for a in range(1, 11):
	for h in range(1, 11):
		if abs(x - a * h / sqrt(a * a + 4 * h * h)) < 1e-05:
			print(a, h)
			sys.exit()


k = float(input())
flag = True
for i in range(1, 11):
	for j in range(1, 11):
		if abs(k - i / 2 * j / ((i / 2) ** 2 + j ** 2) ** (1 / 2)) <= 1e-06:
			flag = False
			print(i, j)
			break
	if not flag:
		break