codeforces502—C. The Phone Number（思维+构造）

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 n

can be a secret phone number. Only those permutations that minimize secret value might be the phone of her husband.

The sequence of n

integers is called a permutation if it contains all integers from 1 to n

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,…,aik

where 1≤i1<i2<…<ik≤n is called increasing if ai1<ai2<ai3<…<aik. If ai1>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]

, LIS of this permutation will be [1,2,3,5], so the length of LIS is equal to 4. LDS can be [6,4,1], [6,4,2], or [6,4,3], so the length of LDS is 3

.

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 n

(1≤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

4

Output

Copy

3 4 1 2

Input

Copy

2

Output

Copy

2 1

Note

In the first sample, you can build a permutation [3,4,1,2]

. LIS is [3,4] (or [1,2]), so the length of LIS is equal to 2. LDS can be ony of [3,1], [4,2], [3,2], or [4,1]. The length of LDS is also equal to 2. The sum is equal to 4. Note that [3,4,1,2]

is not the only permutation that is valid.

In the second sample, you can build a permutation [2,1]

. LIS is [1] (or [2]), so the length of LIS is equal to 1. LDS is [2,1], so the length of LDS is equal to 2. The sum is equal to 3. Note that permutation [1,2] is also valid.

题意：

给一个n，输出一个1——n的序列，使得LIS+LDS的长度最小

思路：刘妍大佬给的思路。

这道题就是将n个数划分成sqrt(n)个每一段都是sqrt(n)的长度的区间，放的时候类似于：10 11 12 7 8 9 4 5 6 1 2 3.像这样，多余的数字就放在后边就好了。这样LIS就是每一段的个数。LDS就是区间个数。

代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,lala,qvjian;
    int logal;
    scanf("%d",&n);
            logal=0;
        lala=sqrt(n);
        qvjian=n/lala;
        if(n%lala!=0)
        {
            qvjian++;
            logal=1;
        }
        int last=n+1;
        for(int i=1;i<qvjian;i++){
            int qi=last-lala;
            int tem=qi;
            for(int j=1;j<=lala;j++){
                cout<<tem<<" ";
                tem++;
            }
            last=qi;
        }
        if(!logal){
            for(int i=1;i<=lala;i++){
                cout<<i<<" ";
            }
            cout<<endl;
        }
        else{
            int kaka=n%lala;
            for(int i=1;i<=kaka;i++){
                cout<<i<<" ";
            }
            cout<<endl;
        }
}