#include <bits/stdc++.h>
int n[20], k[20];
void init() {
  for (int i = 0; i < 20; i++) {
    n[i] = i * 2 + 1;
    k[i] = ((n[i] * n[i]) - 1) / 8;
  }
}
int search(int _x) {
  int _k = (_x + 2) / 4;
  for (int i = 0; i < 20; i++) {
    if (k[i] >= _k) return i;
  }
  return -1;
}
int main() {
  int x;
  init();
  while (~scanf("%d", &x)) printf("%d\n", x == 3 ? 5 : n[search(x)]);
  return 0;
}
