Stack implementation with C++ using array

#include <iostream>

using namespace std;

#define MAX 1000

class Stack{
    int top;
public:
    int a[MAX];

    Stack(){ top = -1; }
    bool push(int x);
    int pop();
    int peek();
    bool isEmpty();
};

bool Stack::push(int x)
{
    if(top >= (MAX-1)){
        cout << "Stack Overflow";
        return false;
    } else{
        a[++top] = x;
        cout << x << " pushed into stack\n";
    }
}

int Stack::pop(){

    if(top<0){
        cout<< "Stack Underflow";
        return 0;
    } else{
        int x = a[top--];
        return x;
    }
}

int Stack::peek()
{
    if(top < 0) {
        cout << "Stack is Empty";
        return 0;
    } else{
        int x = a[top];
        return x;
    }
}

bool Stack::isEmpty()
{
    return (top < 0);
}

int main()
{
    class Stack s;
    s.push(10);
    s.push(20);
    s.push(30);
    cout<< s.pop() << " Popped from stack\n";
    cout<<"Element present in stack : ";
    while(!s.isEmpty())
    {
        cout<<s.peek()<<" ";
        s.pop();
    }
    return 0;
}