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>
import java.util.*;
   public class Main{
   public static void main (String [] args){
          int n=0;
  Scanner in = new Scanner (System.in);

      int x = in.nextInt();

       if( x==1){
  System.out.print("1");
       }
     if( x==2){
  System.out.print("3");
}

     if(x==3){
   	 System.out.print("5");
   }

     if(x>3 && x<=5)
   System.out.print("3");
   
  else if(x>=6 && x<=13)
    System.out.print("5");

 else if(x>=14 && x<=25)
    System.out.print("7");

  else if(x>=26 && x<=41)
    System.out.print("9");

   else if(x>=42 && x<=61)
    System.out.print("11");

    else if(x>=62 && x<=85)
    System.out.print("13");

    else if(x>=86 && x<=100)
    System.out.print("15");
 
}
}

