Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

type Railway struct {
	trains trains
}

type trains []int

func main() {
	var stdin string
	var s = bufio.NewScanner(os.Stdin)

	railway := Railway{}
	for s.Scan() {
		stdin = s.Text()

		n, err := strconv.Atoi(stdin)
		if err != nil {
			continue
		}
		railway.lifo(n)
	}
}

func (r *Railway) lifo(n int) {
	if n == 0 {
		if len(r.trains) == 0 {
			return
		}
		fmt.Println(r.trains[len(r.trains)-1])
		r.trains = r.trains[:len(r.trains)-1]
	} else {
		r.trains = append(r.trains, n)
	}
}

C++: #include<iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<sstream>
#include<algorithm>
#include<map>
#include<complex>
using namespace std;


#define li			long long int
#define rep(i,to)	for(int i=0;i<((int)(to));i++)
#define repp(i,start,to)	for(int i=(int)(start);i<((int)(to));i++)
#define pb			push_back
#define sz(v)		((li)(v).size())
#define bgn(v)		((v).begin())
#define eend(v)		((v).end())
#define allof(v)	(v).begin(), (v).end()
#define dodp(v,n)		memset(v,(li)n,sizeof(v))
#define bit(n)		(1ll<<(li)(n))
#define mp(a,b)		make_pair(a,b)
#define rin	rep(i,n)
#define EPS 1e-10
#define ETOL 1e-8
#define MOD 1000000007
#define p2(a,b)		cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)		cout<<a<<"\t"<<b<<"\t"<<c<<endl


int main(){
	li p;
	stack<li> stk;
	
	while(cin>>p){
		if(p>0)stk.push(p);
		else{
			cout<<stk.top()<<endl;
			stk.pop();
		}
	}
	
	return 0;
}

C++: #include <iostream>
#include <stack>

using namespace std;

int main(){
	int n;
	stack<int> st;
	
	while(cin>>n){
		if(n==0){
			cout<<st.top()<<endl;
			st.pop();
		}else{
			st.push(n);
		}
	}

	return 0;
}

C++: #include <iostream>
#include <stack>

int main()
{
	std::stack<int> st;
	int n;

	while (std::cin >> n)
	{
		if (n == 0)
		{
			std::cout << st.top() << std::endl;
			st.pop();
		}
		else
		{
			st.push(n);
		}
	}

}

C++: #include <iostream>
#include <deque>

int main(){
	std::deque<int> que;
	int tmp;
	while(std::cin >> tmp){
		if(tmp == 0) std::cout << que.pop_back() << std::endl;
		else que.push_back(tmp);
	}
		return 0;
	}

C++: #include<cstdio>
#include<iostream>
#include<stack>

using namespace std;       
int main(){
  stack<int> s;
  int a;
  while(cin >> a){
    if(a != 0){
      s.push(a);
    }else{
      cout << s.top();
      s.pop();
    }
    if(s.size() == 0)
      break;
  }
  return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;

int main()
{
	int queue[100], input, i = 0;
	while (cin >> input) {
		if (input != 0) {
			queue[i] = input;
			++i;
		}
		else {
			--i;
			cout << queue[i] << endl;
			queue[i] = 0;
		}
	}
	return 0;
}

C++: #include <iostream>
#include <stack>
using namespace std;

int main(){
	stack<int> st;
	int n;

	while(cin >> n){
		if(n!=0){
			st.push( n );
		}else{
			cout << st.top() << endl;
			st.pop();
		}
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int b[10000000];
int main(){
  int i=0,num,a[10],x=0;
  
  while(cin>>num){
    if(num==0){
      b[x++]=a[i-1];
      i--;
    }
    else  a[i++]=num;
    if(!i)break;
  }
  
  for(i=0;i<x;i++)
    cout<<b[i]<<endl;
  return 0;
}

C++: #include <algorithm>
#include <sstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <queue>
#include <vector>
using namespace std;

int main()
{
	int x;
	stack<int> S;
	while (cin >> x && x != EOF) {
		if (x == 0) {
			cout << S.top() << endl; S.pop();
		}
		else {
			S.push(x);
		}
	}
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include <vector>
#include <iostream>
using namespace std;

int main() {
	int in;
	vector <int> a;
	while (1) {
		cin >> in;
		if (in == 0) {
			cout << a.back();
			a.pop_back();
			if (a.size() == 0)
				break;
			else
				cout << endl;
		}
		else
			a.push_back(in);
	}
	return 0;
}

C++: #include <iostream>

int main()
{
        int s[10], p = 0;
        int i;
        while(std::cin >> i)
                if(i)
                        s[p++]=i;
                else
                        std::cout << s[--p] << std::endl;
        return 0;
}

C++: #include <iostream>
#include <stack>
using namespace std;

int main(){
	stack<int> st;
	int n, a;

	while(cin >> n){
		if(n!=0){
			st.push( n );
		}else{
			a = st.top();
			cout << a << endl;
			st.pop();
		}
	}
}

C++: #include <cstdio>
#include <deque>

using namespace std;

int main(){
  deque<int> st;
  int n;
  while(~scanf("%d",&n)){
    if(n){
      st.push_back(n);
    }else{
      printf("%d\n",st.back());
      st.pop_back();
    }
  }
}

C++: #include <map>
#include <string>
#include <iostream>
#include <vector>
#include <set>
#include <cstdio>
#include <stack>
#include <algorithm>

using namespace std;

int main()
{
	int num;
	stack<int> nums;
	
	while (cin >> num)
	{
		if (num == 0)
		{
			cout << nums.top() << endl;
			nums.pop();
		} else {
			nums.push(num);
		}
	}
}

C++: #include <stdio.h>

int main(void){
	int i;
	int train[11]={0};
	int t,now=0,count=0;
	int car[11]={0};
	
	for(;;){
		scanf("%d",&t);
		if(t!=0){
			train[now]=t;
			now++;
		}
		else{
			now--;
			car[count]=train[now];
			train[now]=0;
			count++;
			if(now==0)break;
		}/*0
		printf("now=\n");
		for(i=0;i<10;i++){
			printf("car[%d] = %d\n",i,car[i]);
		}
		for(i=0;i<10;i++){
			printf("train[%d] = %d\n",i,train[i]);
		}
		*/
	}
	
	i=0;
	while(car[i]!=0){
		printf("%d\n",car[i]);
		i++;
	}
	
	return 0;
}

C++: #include<stdio.h>
int main(){
int a[100];
int j;
for(int i=0;;i++){
scanf("%d",&a[i]);
if(a[i]==0){
j=i;
while(){
if(j1!=0){
printf("%d",a[j1]);
break;
}
j--;
}
}
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <stack>

using namespace std;

int main()
{
	int n;
	stack<int> t;

	while(cin >> n){
		if(n==0){
			cout << t.top() << endl;
			t.pop();
		}
		else{t.push(n);}
	}

	return 0;
}

C++: #include<iostream>
#include<stack>
using namespace std;
int main(){
		stack<int>s;
		int a;
		while(cin>>a){
				if(a==0){
						//if(s.size()==0)break;
						cout<<s.top()<<endl;
						s.pop();
				}
				else{
						s.push(a);
				}
		}
		return 0;
}

C++: #include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>


using namespace std;

int main(int, char**){
    int tmp;
    stack<int> st;
    while(cin >> tmp){
	if(tmp == 0) {
	    cout << st.top() << endl;
	    st.pop();
	}
	else{
	    st.push(tmp);
	}
    }
    return 0;
}

C++: #include<iostream>
#include<stack>

using namespace std;

int main()
{
	stack<int> hako;
	int temp[100];
	int input[100];
	int t, i = 0, k = 0;
	
	
	while(cin>>t){
		input[i] = t;
		i++;
	}
	
	/*
	while(1){
		cin >> t;
		if( t == -1){
			break;
		}
		input[i] = t;
		i++;
	}
	*/
	for(int j = 0; j < i; j++){
		if(input[j] == 0){
			temp[k] = hako.top();
			hako.pop();
			k++;
		}
		else{
			hako.push(input[j]);
		}
	}
	
	for(int j = 0; j < k; j++){
		cout << temp[j] << endl;
	}
	
}

C++: #include <stack>
#include <iostream>
 
using namespace std;
 
int main(void){
        int tem;
        stack<int> st;
        cin >> tem;
        st.push(tem); 
        while(true){
                cin >> tem;
                if( cin.eof())
                        break;
                if(tem)
                        st.push(tem);
                else{
                        cout <<st.top()<<endl;
                        st.pop(); 
                }
        }
return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<stack>
using namespace std;

stack<int> sta;

int main()
{
  int a;
  while(1){
    cin>>a;
    if(a)
      sta.push(a);
    else{
      cout<<sta.top()<<endl;
      sta.pop();
    }
  }
}