Lazy Security Guard

题意翻译

给定n个相同的，边长为一的小正方形，求用这些正方形拼成的图形中周长最小值是多少。

题目描述

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<=10^{6} $ ), the number of city blocks that must be enclosed by the route.

输出格式

Print the minimum perimeter that can be achieved.

输入输出样例

输入样例 #1

4

输出样例 #1

8

输入样例 #2

11

输出样例 #2

14

输入样例 #3

22

输出样例 #3

20

说明

Here are some possible shapes for the examples: 

题意翻译

给定n个相同的，边长为一的小正方形，求用这些正方形拼成的图形中周长最小值是多少。