CF201A.Clear Symmetry

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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$ .

输入格式

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

输出格式

Print a single number — the sought value of $n$ .

输入输出样例

输入#1
```
4
```
输出#1
```
3
```
输入#2
```
9
```
输出#2
```
5
```

说明/提示

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

首页