import java.lang.*;

public class selfsort
{ int data;
  boolean got_data;
  selfsort little_pal;

  public selfsort()
  { data=0; got_data=false; little_pal=null; }

  public selfsort(int x)
  { data=x; got_data=true; little_pal=null; }

  public void insert(int x)
  { if (!got_data)
    { got_data=true;
      data=x;
      return; }
    if (x<data)
    { int temp=x;
      x=data;
      data=temp; }
    if (little_pal==null)
    { little_pal=new selfsort(x);
      return; }
    little_pal.insert(x); }

  public boolean have_you_got(int x)
  { if (got_data && data==x)
      return (true);
    if (little_pal==null)
      return (false);
    boolean answer=little_pal.have_you_got(x);
    return (answer); }

  public int surrender_smallest()
  { boolean got_answer=false;
    int answer=0, reply=-1;
    if (got_data)
    { answer=data;
      got_answer=true;
      got_data=false; }
    if (little_pal!=null)
      reply=little_pal.surrender_smallest();
    if (reply!=-1)      // -1 is signal for "I'm empty"
    { if (got_answer)
      { data=reply;
        got_data=true; }
      else
      { answer=reply;
        got_answer=true; } }
    if (got_answer)
      return (answer);
    else
      return (-1); } }