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>
#include <bits/stdc++.h>
using namespace std;
int f[101];
int find2(int x) {
  for (int i = 0; i < (int)(2 * x); i++) {
    if ((i * i + 1) / 2 >= x) return i;
  }
  return 0;
}
int find3(int x, int a, int b, int c) {
  int d = max(2 * a + c, 2 * b + c);
  if (c == 1) {
    while (((d - 1) * (d - 1) + 1) / 2 < x) {
      d++;
    }
    return d;
  } else {
    while ((d - 1) * (d - 1) - ((d - 1) * (d - 1) + 1) / 2 < x) d++;
    return d;
  }
}
int find(int x) {
  int ret = 2 * x - 1;
  if (x % 4 == 0) {
    ret = find2(x / 4) * 2 + 2;
  }
  int c = x % 2;
  for (int i = 0; i <= x; i++) {
    for (int j = 0; 2 * j + 2 * i + c <= x; j++) {
      int d = x - i - i - j - j - c;
      if (d >= 0 && d % 4 == 0) ret = min(ret, find3(d / 4, i, j, c) * 2 - 1);
    }
  }
  return ret;
}
int main(int argc, char *argv[]) {
  int x;
  cin >> x;
  cout << find(x) << endl;
  return EXIT_SUCCESS;
}
