Could someone help me write a short program to determine the value at the bottom entry in a stack w/o changing the stack?

Thanks, I'm a bit over my head in an algorithms course.
This stack has a seperate interface and an implementation file with the code for the push, pop, init, and empty functions.

Heres what I have as an idea?

int STACKvalue (int value)
int i, N = 0;
Item x[value];
while (!STACKempty)
{
x[N] = STACKpop();
N++;
}