C. The Phone Number （ Codeforces Round #502 ）-CSDN博客

C. The Phone Number

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Mrs. Smith is trying to contact her husband, John Smith, but she forgot the secret phone number!

The only thing Mrs. Smith remembered was that any permutation of nn can be a secret phone number. Only those permutations that minimize secret value might be the phone of her husband.

The sequence of nn integers is called a permutation if it contains all integers from 11 to nn exactly once.

The secret value of a phone number is defined as the sum of the length of the longest increasing subsequence (LIS) and length of the longest decreasing subsequence (LDS).

A subsequence ai1,ai2,…,aikai1,ai2,…,aik where 1≤i1<i2<…<ik≤n1≤i1<i2<…<ik≤n is called increasing if ai1<ai2<ai3<…<aikai1<ai2<ai3<…<aik . If ai1>ai2>ai3>…>aikai1>ai2>ai3>…>aik , a subsequence is called decreasing. An increasing/decreasing subsequence is called longest if it has maximum length among all increasing/decreasing subsequences.

For example, if there is a permutation [6,4,1,7,2,3,5][6,4,1,7,2,3,5] , LIS of this permutation will be [1,2,3,5][1,2,3,5] , so the length of LIS is equal to 44 . LDS can be [6,4,1][6,4,1] , [6,4,2][6,4,2] , or [6,4,3][6,4,3] , so the length of LDS is 33 .

Note, the lengths of LIS and LDS can be different.

So please help Mrs. Smith to find a permutation that gives a minimum sum of lengths of LIS and LDS.

Input

The only line contains one integer nn (1≤n≤1051≤n≤105 ) — the length of permutation that you need to build.

Output

Print a permutation that gives a minimum sum of lengths of LIS and LDS.

If there are multiple answers, print any.

Examples

Input

Copy

Output

Copy

3 4 1 2

Input

Copy

Output

Copy

2 1

Note

In the first sample, you can build a permutation [3,4,1,2][3,4,1,2] . LIS is [3,4][3,4] (or [1,2][1,2] ), so the length of LIS is equal to 22 . LDS can be ony of [3,1][3,1] , [4,2][4,2] , [3,2][3,2] , or [4,1][4,1] . The length of LDS is also equal to 22 . The sum is equal to 44 . Note that [3,4,1,2][3,4,1,2] is not the only permutation that is valid.

In the second sample, you can build a permutation [2,1][2,1] . LIS is [1][1] (or [2][2] ), so the length of LIS is equal to 11 . LDS is [2,1][2,1] , so the length of LDS is equal to 22 . The sum is equal to 33 . Note that permutation [1,2][1,2] is also valid.

分块做，自己手动模拟一下可以发现规律。例如假如反向输出，表明分为n块，则最长下降在每块里面选1个为n,上升则为块的大小1，结果为n+1，然后依次加大块会发现，结果会减小。

#include <stdio.h>
#include <cstring>
#include <math.h>
#include <string>
#include <queue>
#include <map>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN=1e5+70;
const int MAX=1e9+7;
struct node
{
    int x,y;
};
int num[MAXN],num1[MAXN];
int main()
{
    ios::sync_with_stdio(false);
    int n;
    while(cin>>n)
    {
    int sz=sqrt(n);//块数
    
    for(int i=1;i<=n;i++)
    {
        num[i]=i;
    }
    
    int cnt=n/sz;//块的大小
    int tot=n;
    for(int i=1;i<=sz;i++)
    {
        for(int j=1;j<=cnt;j++)
        {
            cout<<num[tot-cnt+j]<<" ";
        }
        tot-=cnt;
    }
    for(int i=1;i<=tot;i++)
        cout<<num[i]<<" ";
        cout<<endl;

   // else cout<<"1"<<endl;
    }
    return 0;
}