import java.util.*;
import java.lang.*;
import java.io.*;

class Ideone
{
//	boolean sorted(Integer[] n,int i){while(i-->1)if(n[i]<n[i-1])return false;return true;}void bogo(Integer[] n){List<Integer>l=Arrays.asList(n);while(!sorted(n,n.length)){Collections.shuffle(l);l.toArray(n);}}

	public static 
	boolean sorted(Integer[] n,int i)
	{
		while(i --> 1) // i..1
			if(n[i] < n[i-1]) // ascending order
				return false;
		
		return true;
	}
	
	public static 
	void bogo(Integer[] n)
	{
		List<Integer>l = Arrays.asList(n);
		
		while(!sorted(n, n.length))
		{
			Collections.shuffle(l); // shuffle
			l.toArray(n); // re-fill the array
		}
	}
	
	public static void main(String[] args) throws java.lang.Exception
	{
		Integer[] a = { 3, 5, 1, 7, 4, 0, -2 };
		bogo(a);
		for(Integer x : a) System.out.print(x+" ");
	}
}