import java.util.Scanner;
public class SingleLL
{
Node start=new Node();
Node end=new Node();
Node curr=new Node();
int num;
SingleLL()
{
start=null;
end=null;
num=0;
}
void AddBeg(int val)
{
Node t=new Node();
t.info=val;
if(num++==0)
end=t;
else
t.next=start;
start=t;
}
void AddEnd(int val)
{