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.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map.Entry;
import java.util.Scanner;

public class Main {

    public void dfs(){
    }





    public void solve() {
        Scanner sc=new Scanner(System.in);

        int n=sc.nextInt();

        if(n==1){
            ln(1);
            return;
        }
        if(n==3){
            ln(5);
            return;
        }


        if(1<=n && n<=5){
            ln(3);
            return;
        }
        if(5<n && n<=13){
            ln(5);
            return;
        }
        if(13<n && n<=25){
            ln(7);
            return;
        }
        if(25<n && n<=41){
            ln(9);
            return;
        }
        if(41<n && n<=61){
            ln(11);
            return;
        }
        if(61<n && n<=85){
            ln(13);
            return;
        }
        if(85<n && n<=100){
            ln(15);
            return;
        }
    }

    public void run() {
        solve();
    }

    public static void main(String[] _) {
        new Main().run();
    }

    public static void ln() {
        System.out.println();
    }
    public static void ln(Object o) {
        System.out.println(o);
    }

    public static void pr(Object o) {
        System.out.print(o);
    }

}
