#include <fstream>
using namespace std;
ifstream cin("bucketsort.in");
ofstream cout("bucketsort.out");
int v[10001],i,j,n,k;
int pivot(int i,int j)
{
    int p=1;
    while(i<j)
    {
        if(v[i]*k<v[j]*k)
        {
            swap(v[i],v[j]);
                p=-p;
        }
        if(p==1)
            j--;
        else
            i++;
    }
    return i;
}
void div_imp(int i,int j)
{
    if(i<j)
    {
        int p=pivot(i,j);
        div_imp(i,p-1);
        div_imp(p+1,j);
    }
}
int main()
{
    cin>>n;
    for(i=1;i<=n;i++)
        cin>>v[i];
    cin>>k;
    if(k==0)
        k=-1;
    div_imp(1,n);
    for(i=1;i<=n;i++)
        cout<<v[i]<<" ";
}