//
//	List class
//	P. 91
//
import java.util.Scanner;
class List
{
	private final int MAX = 50;
	private int length;
	private int[] data;

	public List() { length=0; data=new int[MAX];}
	public void Insert(int item)
	{
		data[length] = item;
		length ++;
	}
	public void Print()
	{
		for(int i=0; i<length; i++)
			System.out.print(data[i] + " ");
		System.out.println();
	}
	public boolean IsPresent(int item)
	{
		boolean done = false;
		for(int i=0; i<length&&!done; i++)
			if(data[i] == item)	done = true;
		return done;
	}
	// p.94
	public void SelSort()
	{
		int temp;
		int passCount;
		int minIndex;
		for(passCount=0; passCount<length-1; passCount++)
		{
			minIndex = passCount;
			for(int k=passCount+1; k<length; k++)
			{
				if(data[minIndex] > data[k])
					minIndex = k;
			}
			// swap
			temp = data[minIndex];
			data[minIndex] = data[passCount];
			data[passCount] = temp;
		}
	}
	public void SelDescSort()	// sort to descending
	{
		int temp;
		int passCount;
		int minIndex;
		for(passCount=0; passCount<length-1; passCount++)
		{
			minIndex = passCount;
			for(int k=passCount+1; k<length; k++)
			{
				if(data[minIndex] < data[k])
					minIndex = k;
			}
			// swap
			temp = data[minIndex];
			data[minIndex] = data[passCount];
			data[passCount] = temp;
		}
	}
	public static void main(String[] args)
	{
		Scanner input = new Scanner(System.in);
		int x, y;
		int a = input.nextInt();
		int b = input.nextInt();
		x = input.nextInt();
		y = input.nextInt();
		List z = new List();

		z.Insert(a);
		z.Insert(b);
		z.Insert(x);
		z.Insert(y);

		z.SelSort();
		z.Print();

		// p.93
		if(z.IsPresent(77))
			System.out.println("\n\n77 is found");
		else
			System.out.println("\n\n77 is not in the list");

		System.out.println("\n\nDone.\n\n");
	}
}