Codeforces 534D Handshakes【贪心】

D. Handshakes

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and before sitting down at his desk, greeted with those who were present in the room by shaking hands. Each of the students who came in stayed in CTOP until the end of the day and never left.

At any time any three students could join together and start participating in a team contest, which lasted until the end of the day. The team did not distract from the contest for a minute, so when another student came in and greeted those who were present, he did not shake hands with the members of the contest writing team. Each team consisted of exactly three students, and each student could not become a member of more than one team. Different teams could start writing contest at different times.

Given how many present people shook the hands of each student, get a possible order in which the students could have come to CTOP. If such an order does not exist, then print that this is impossible.

Please note that some students could work independently until the end of the day, without participating in a team contest.

Input

The first line contains integer n (1 ≤ n ≤ 2·10⁵) — the number of students who came to CTOP. The next line contains n integers a₁, a₂, ..., a_n (0 ≤ a_i < n), where a_i is the number of students with who the i-th student shook hands.

Output

If the sought order of students exists, print in the first line "Possible" and in the second line print the permutation of the students' numbers defining the order in which the students entered the center. Number i that stands to the left of number j in this permutation means that the i-th student came earlier than the j-th student. If there are multiple answers, print any of them.

If the sought order of students doesn't exist, in a single line print "Impossible".

Examples

Input

5
2 1 3 0 1

Output

Possible
4 5 1 3 2 

Input

9
0 2 3 4 1 1 0 2 2

Output

Possible
7 5 2 1 6 8 3 4 9

Input

4
0 2 1 1

Output

Impossible

Note

In the first sample from the statement the order of events could be as follows:

• student 4 comes in (a₄ = 0), he has no one to greet;
• student 5 comes in (a₅ = 1), he shakes hands with student 4;
• student 1 comes in (a₁ = 2), he shakes hands with two students (students 4, 5);
• student 3 comes in (a₃ = 3), he shakes hands with three students (students 4, 5, 1);
• students 4, 5, 3 form a team and start writing a contest;
• student 2 comes in (a₂ = 1), he shakes hands with one student (number 1).

In the second sample from the statement the order of events could be as follows:

• student 7 comes in (a₇ = 0), he has nobody to greet;
• student 5 comes in (a₅ = 1), he shakes hands with student 7;
• student 2 comes in (a₂ = 2), he shakes hands with two students (students 7, 5);
• students 7, 5, 2 form a team and start writing a contest;
• student 1 comes in(a₁ = 0), he has no one to greet (everyone is busy with the contest);
• student 6 comes in (a₆ = 1), he shakes hands with student 1;
• student 8 comes in (a₈ = 2), he shakes hands with two students (students 1, 6);
• student 3 comes in (a₃ = 3), he shakes hands with three students (students 1, 6, 8);
• student 4 comes in (a₄ = 4), he shakes hands with four students (students 1, 6, 8, 3);
• students 8, 3, 4 form a team and start writing a contest;
• student 9 comes in (a₉ = 2), he shakes hands with two students (students 1, 6).

In the third sample from the statement the order of events is restored unambiguously:

• student 1 comes in (a₁ = 0), he has no one to greet;
• student 3 comes in (or student 4) (a₃ = a₄ = 1), he shakes hands with student 1;
• student 2 comes in (a₂ = 2), he shakes hands with two students (students 1, 3 (or 4));
• the remaining student 4 (or student 3), must shake one student's hand (a₃ = a₄ = 1) but it is impossible as there are only two scenarios: either a team formed and he doesn't greet anyone, or he greets all the three present people who work individually. 

题目大意：

一个屋子，我们需要构造出来一个序列，按照编号顺序一个一个进入房间，已知进来的这个人要和屋子中没有进行组队训练的每一个人都要握手。

组队训练是三个人任意组队。

现在给你每个编号握手的次数，让你构造出来一个序列，满足这个条件。

思路：

贪心，第一个人肯定是要找一个握手次数为0的人进入，接下来是握手次数为1的人进入...........依次类推，直到没有握手次数为x的人的时候，我们考虑让最后三个进来的小伙伴组成一个队伍去训练，然后再看看还有没有握手次数为x-3的选手，如果没有，继续让按照顺序进来的最后三个小伙伴组成一个队伍去训练，然后再看看有没有握手次数为x-6的选手，如果有，那么继续判断x-5................

依次类推。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;
struct node
{
    int num,pos;
}a[2000500];
int ans[200080];
queue<int >s[200080];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        stack<int >output;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i].num);
            a[i].pos=i;
            s[a[i].num].push(i);
        }
        if(s[0].size()==0)
        {
            printf("Impossible\n");
            continue;
        }
        int now=0;
        int cnt=0;
        while(1)
        {
            if(s[now].size()==0)
            {
                if(now-3<0)break;
                s[now-1].pop();
                s[now-2].pop();
                s[now-3].pop();
                now-=3;
            }
            else
            {
                ans[cnt++]=s[now].front();
                now++;
            }
        }
        if(cnt==n)
        {
            printf("Possible\n");
            for(int i=0;i<n;i++)
            {
                printf("%d ",ans[i]);
            }
            printf("\n");
        }
        else printf("Impossible\n");
    }
}