//
//	pg. 137
//	ADT- list: array of items with var. length
//

#include <iostream>
using namespace std;

const int MAX = 50;

class List
{ 	
	int data[MAX];	// can be different ex string
	int length;	// always int
public:
	List() { length = 0;	}
	int Length()
	{	return length; }
	void Insert(int item)	//must match data type
	{	data(length) = item;
	length ++;
	}
	void Print() const
	{	for(int i=0; i<length; i++}
			cout << data[i] << " ";
		cout << "\n";
	}
	// sequential search, p.139
	bool Is.Present(int item) const
	{	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 see pg 138
        int z;
        cin >> z;
        while ( cin)
        ( real.Insert ( z);
                cin >> z;
        }
	cout << real.Length ();
	real.Print();
	return 0;
}