stack using java

public class Lifo {
int top = -1;
int array[]= new int[5];
Lifo(){

}

public void push(int a) {
	if(top == 3) {
		System.out.println("stack is full");
	}
	else {
	array[top +1]= a;
   top=top+1;
	}
}
public void pop() {
	if(top==-1) {
		System.out.println("stack is empty");
	}
	else {
	top=top-1;
	}
}
public void print() {
	for(int i=0;i<=top;i++) {
		System.out.println(array[i]);
	}
}

public static void main(String[] args) {
	Lifo l = new Lifo();
l.pop();
l.push(0);
l.push(1);
l.push(2);
//l.pop();
l.push(3);
l.push(4);
	l.print();
}

}