#include <stdio.h>
void quickSort(int arr[], int left, int right)
{
int i = left, j = right;
int pivot = arr[(left + right) / 2];
int temp;
do
{
while (arr[i] < pivot)
i++;
while (arr[j] > pivot)
j--;
if (i<= j)
{
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
i++;
j--;
}
}
while (i<= j);
{
if (left < j)
quickSort(arr, left, j);
if (i < right)
quickSort(arr, i, right);
}
}
int main()
{
int i;
int n;
int list[300000] = {0,};
int ans[300000] = {0,};
for(i=0;i<n;i++)
{
}
quickSort(list, 0, n-1);
for(i=0;i<n;i++)
{
ans[i]=list[i];
if(i>0)
{
if(list[i]==list[i-1])
{
continue;
}
ans[i]=list[i];
}
}
for(i=0; i<n; i++)
{
if(list[i]!=0)
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+Cgp2b2lkIHF1aWNrU29ydChpbnQgYXJyW10sIGludCBsZWZ0LCBpbnQgcmlnaHQpIAp7CiAgaW50IGkgPSBsZWZ0LCBqID0gcmlnaHQ7CiAgaW50IHBpdm90ID0gYXJyWyhsZWZ0ICsgcmlnaHQpIC8gMl07CiAgaW50IHRlbXA7CiAgZG8KICB7CiAgICB3aGlsZSAoYXJyW2ldIDwgcGl2b3QpCiAgICAgIGkrKzsKICAgICAgd2hpbGUgKGFycltqXSA+IHBpdm90KQogICAgICAgIGotLTsKICAgICAgICBpZiAoaTw9IGopCiAgICAgICAgewogICAgICAgICAgICB0ZW1wID0gYXJyW2ldOwogICAgICAgICAgICBhcnJbaV0gPSBhcnJbal07CiAgICAgICAgICAgIGFycltqXSA9IHRlbXA7CiAgICAgICAgICAgIGkrKzsKICAgICAgICAgICAgai0tOwogICAgICAgIH0KICB9IAogIHdoaWxlIChpPD0gaik7CiAgewogIGlmIChsZWZ0IDwgaikKICAgIHF1aWNrU29ydChhcnIsIGxlZnQsIGopOwoKICBpZiAoaSA8IHJpZ2h0KQogICAgcXVpY2tTb3J0KGFyciwgaSwgcmlnaHQpOwogIH0KfQoKaW50IG1haW4oKQp7CiAgaW50IGk7CiAgaW50IG47CiAgc2NhbmYoIiVkIiwmbik7CiAgaW50IGxpc3RbMzAwMDAwXSA9IHswLH07CiAgaW50IGFuc1szMDAwMDBdID0gezAsfTsKICBmb3IoaT0wO2k8bjtpKyspCiAgewogIAlzY2FuZigiJWQiLCZsaXN0W2ldKTsKICB9CiAgcXVpY2tTb3J0KGxpc3QsIDAsIG4tMSk7CiAgZm9yKGk9MDtpPG47aSsrKQogIHsgCiAgICBhbnNbaV09bGlzdFtpXTsKICAJaWYoaT4wKQogIAl7CiAgCSAgaWYobGlzdFtpXT09bGlzdFtpLTFdKQoJICB7CgkJY29udGludWU7CQoJICB9CQoJICBhbnNbaV09bGlzdFtpXTsKCX0KICB9CiAgZm9yKGk9MDsgaTxuOyBpKyspCiAgewogIAlpZihsaXN0W2ldIT0wKQoJICBwcmludGYoIiVkICIsIGxpc3RbaV0pOwogIH0KICByZXR1cm4gMDsKfQ==