// Page 180-182

import java.util.Scanner;
public class SortedList
{
	final int MAX = 50;
	private int[] data = new int[MAX];
	private int length;
	public SortedList()
	{
		length  = 0;
	}
	public int Length()
	{
		return length;
	}
	public boolean IsEmpty ()
	{
		return length == 0;
	}
	public boolean IsPresent (int item)
	{
		int position = posBinarySearch(item);
		if (position<0)
			return false;
		else
			return true;
	}
	public void Print ()
	{
		for (int k=0; k<length; k++)
			System.out.print(data[k] + " ");
		System.out.println();
	}
	public void Insert (int item)
	{
		data[length] = item;
		length ++;
		// sorting
		SelSort();
	}
	public void SelSort ()
	{
		int temp;	// for swapping
		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;
			}
			temp = data[minIndex];
			data[minIndex] = data[passCount];
			data[passCount] = temp;
		}
	}
	private int posBinarySearch (int item)
	{
		int first = 0;		// index: 0 to length-1
		int last = length - 1;
		int middle = 0;
		boolean found = false;
		int position = -1;
		while (last >=first && !found)
		{
			middle = (first + last) / 2;
			if ( item < data[middle] )	// located first half
				last = middle - 1;
				else if ( item > data[middle] )// located last half
				first = middle + 1;
			else	found = true;
		}  // found or not find (last < first)
		if(found)
			position = middle;
		return position;
	}
}