import java.util.Scanner;
    import java.io.*;
    public class Qs
    {
     static String a[]=new String[1000];
    static void quicksort(int First,int Last)
    {
    int i,j,pivot;
    if(First<Last)
    {
    pivot=First;
    i=First;
    j=First+1;
    while(j<=Last)
    {
    if(a[pivot].compareTo(a[j])>0)
    {
    i++;
    swap(i,j);
    }
    j++;
    }
    swap(pivot,i);
    quicksort(First,i-1);
    quicksort(i+1,Last);
    }
    }
    static void swap(int swap,int s) 
    {
    String temp;
    temp=a[swap];
    a[swap]=a[s];
    a[s]=temp;
    }
    public static void main(String []args)
    {
    int i,n;
    Scanner sc=new Scanner(System.in);
    System.out.println("Enter the size of array");
    n=sc.nextInt();
    System.out.println("Enter the elemnts in an array");
    for(i=0;i<=n;i++)
    {
    a[i]=sc.nextLine();
    }
    quicksort(0,n);
    System.out.println("The sorted array is: ");
    for(i=0;i<=n;i++)
    {
    System.out.print("  "+a[i]);
    }
    }
    }