CF201A.Clear Symmetry

Consider some square matrix A with side n consisting of zeros and ones. There are n rows numbered from 1 to n from top to bottom and n columns numbered from 1 to n from left to right in this matrix. We'll denote the element of the matrix which is located at the intersection of the i-row and the j-th column as A__i, j.

Let's call matrix A clear if no two cells containing ones have a common side.

Let's call matrix A symmetrical if it matches the matrices formed from it by a horizontal and/or a vertical reflection. Formally, for each pair (i, j) (1 ≤ i, j ≤ n) both of the following conditions must be met: A__i, j = A__n - i + 1, j and A__i, j = A__i, n - j + 1.

Let's define the sharpness of matrix A as the number of ones in it.

Given integer x, your task is to find the smallest positive integer n such that there exists a clear symmetrical matrix A with side n and sharpness x.

考虑一个边长为 $n$ 的方阵 $A$，其中仅包含 $0$ 和 $1$。该矩阵从上到下有 $n$ 行，编号为 $1$ 至 $n$；从左到右有 $n$ 列，编号也为 $1$ 至 $n$。我们将位于第 $i$ 行、第 $j$ 列的矩阵元素记作 $A_{i,j}$。

若矩阵 $A$ 中任意两个值为 $1$ 的格子均不相邻（即没有公共边），则称该矩阵为清晰的（clear）。

若矩阵 $A$ 在水平翻转和/或垂直翻转后保持不变，则称其为对称的（symmetrical）。形式化地说，对每一对 $(i,j)$（其中 $1 \le i,j \le n$），以下两个条件必须同时成立：

$$A_{i,j} = A_{n-i+1,\,j} \quad \text{且} \quad A_{i,j} = A_{i,\,n-j+1}.$$

定义矩阵 $A$ 的锐度（sharpness）为其所含 $1$ 的个数。

给定整数 $x$，你的任务是找出最小的正整数 $n$，使得存在一个边长为 $n$、锐度为 $x$ 的清晰且对称的矩阵 $A$。

The only line contains a single integer x (1 ≤ x ≤ 100) — the required sharpness of the matrix.

唯一一行包含一个整数 $x$（$1 ≤ x ≤ 100$）——矩阵所需的锐度。

Print a single number — the sought value of n.

输出一个整数——所求的 $n$ 值。

The figure below shows the matrices that correspond to the samples:

下图展示了与样本对应的矩阵：