#P859B. Lazy Security Guard
-
ID: 5916
Type: RemoteJudge
2000ms
256MiB
Tried: 0
Accepted: 0
Difficulty: 3
Uploaded By:
Hydro
Tags> Lazy Security Guard
Description
Your security guard friend recently got a new job at a new security company. The company requires him to patrol an area of the city encompassing exactly N city blocks, but they let him choose which blocks. That is, your friend must walk the perimeter of a region whose area is exactly N blocks. Your friend is quite lazy and would like your help to find the shortest possible route that meets the requirements. The city is laid out in a square grid pattern, and is large enough that for the sake of the problem it can be considered infinite.
Input will consist of a single integer N (1 ≤ N ≤ 106), the number of city blocks that must be enclosed by the route.
Print the minimum perimeter that can be achieved.
Input
Input will consist of a single integer N (1 ≤ N ≤ 106), the number of city blocks that must be enclosed by the route.
Output
Print the minimum perimeter that can be achieved.
4
11
22
8
14
20
Note
Here are some possible shapes for the examples:
