//this a basic one
public class prosses {
int [] s;
int quu;
int tu;
prosses () {//constructor
s = new int[20];
quu = -1;
tu = 0;
}
void enqueue (int d) {//for input and prosses
if (quu >= 19) {
System.out.println("stack is full");
} else {
s[++quu] = d;
}
}
int dequeue(){//to send the output
if(quu<0 && quu>19 && tu<0 && tu>19) {
System.out.println("not possible");
return 'n';
}
return s[tu++];
}
}