import java.util.Scanner;
public class QuickSort{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int n=0;
n=sc.nextInt();
int A[]=new int[n];
int low=0,high=n-1;
for(int i=0;i[HTML_REMOVED]=x){
j–;
}
A[i]=A[j];
while(i[HTML_REMOVED]=x)
{
i++;
}
A[j]=A[i];
}
A[i]=x;
return i;
}
}
static void Sort(int A[],int low,int high){
if(low<high){
int temp=Partition(A,low,high);
Sort(A,low,temp-1);
Sort(A,temp+1,high);
}
}