#include <bits/stdc++.h>
using namespace std;
int ans[1009];
int main() {
  memset(ans, -1, sizeof(ans));
  for (int i = 1; i <= 15; i += 2) {
    int x = (i * i + 1) / 2;
    int y = (i - 1) / 4 * 2;
    for (int j = 0; j <= y; j++) {
      for (int k = 0; k <= (x - 1 - 2 * y) / 4; k++) {
        for (int l = 0; l <= 1; l++) {
          if (x - 2 * j - 4 * k - l >= 0 && ans[x - 2 * j - 4 * k - l] == -1)
            ans[x - 2 * j - 4 * k - l] = i;
        }
      }
    }
    x = i * i - x;
    y = ((i - 1) / 2 + 1) / 2 * 2;
    for (int j = 0; j <= y; j++)
      for (int k = 0; k <= (x - 2 * y) / 4; k++) {
        if (x - 2 * j - 4 * k >= 0 && ans[x - 2 * j - 4 * k] == -1)
          ans[x - 2 * j - 4 * k] = i;
      }
  }
  int n;
  scanf("%d", &n);
  printf("%d", ans[n]);
}
