#include <bits/stdc++.h>
using namespace std;
int num[100010];
int main() {
  int n;
  cin >> n;
  int k = ceil(sqrt(n));
  int m = ceil((double)n / (double)k);
  int y = m;
  int flag = 0, cnt = 0;
  for (int i = 1; i <= k; i++) {
    int p = 0;
    int j = m;
    while (j--) {
      while (y > n) {
        y--;
      }
      cout << y - p << " ";
      p++;
      cnt++;
      if (cnt == n) {
        flag = 1;
        break;
      }
    }
    y += m;
    if (flag) break;
  }
}
