//
// 	similar to p.139
//	unsorted list
//

#include <iostream>

using namespace std;

const int MAX = 50;

class List
{
	int length;
	int info[MAX];
public:
	// default constructor
	List()
	{	length = 0;	}
	bool IsFull() const	// p.141
	{	return length == MAX;	}
	void InsertItem (int item)	// p.144
	{
		info[length] = item;
		length ++;
	}
	void Print() const
	{
		for(int i=0; i<length; i++)
			cout << info[i] << endl;
	} 

};

int main()
{
	// client code - driver to teat the List class
	List z;		// scores
	int score;
	
	cin >> score;
	while(cin)
	{
		z.InsertItem(score);	
		cin >> score;
	}
	z.Print();

	return 0;
}