//
//	p. 137
//	ADT- List : arrays of items w. var. length
//	read the data from a file and put them in the list:then output the 
//		list

#include <iostream>
using namespace std;

const int MAX = 50;

class List
{
	int data[MAX];
	int length;
public:
	List()  { length = 0; }
	int Length() const
	{	return length;  }
	void  Insert(int item)
	{	data[length] = item;
		length ++;
	}
	void Print() const
	{	for(int i=0; i<length; i ++)
			cout << data[i] << "  ";
			cout << "\n";
	}
	// sequential search, p. 139
	bool IsPresent(int item) 
	{	bool found = false;
		for(int i=0; i<length && !found; i++)
		if(data[i] == item) found = true;
	return found;
	}
};

int main()
{
	List real;	
	// read the data in, p. 138
	int x;
	cin >> x;
	while(cin)
	{	real.Insert (x);
		cin >> x;
	}
	real.Print();

	return 0;
}