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 Ai, 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: Ai, j = An - i + 1, j and Ai, j = Ai, 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.

Input

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

Output

Print a single number — the sought value of n.

Examples

Input

4


Output

3


Input

9


Output

5

Note

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

<image>
//Clear Symmetry
//127 Div2 C

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class _127C
{
    public static BufferedReader br;
    public static StringTokenizer inp;
    public static PrintWriter out;
    public static void main(String[] args)  throws IOException
    {

        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        
        int x = Integer.parseInt(br.readLine());
        if(x==3)x=6;
        for(int i = 1 ; i < 100 ; i+=2) 
        {
            if(x<=(i*i+1)/2)
            {
                out.println(i);
                break;
            }
        }
        
        br.close();
        out.close();
    }
    
    
    
    public static void read() throws IOException{inp = new StringTokenizer(br.readLine());}
    public static int nextInt(){return Integer.parseInt(inp.nextToken());}
    public static long nextLong(){return Long.parseLong(inp.nextToken());}
    public static double nextDouble(){return Double.parseDouble(inp.nextToken());}
    public static String next(){return inp.nextToken();}
    
}
