#include <iostream>
#include <iomanip>

#include "arlist.h"

using namespace std;


const int MAXCAP = 100;     // storage capacity of list

int main()
{
	tNode  list[MAXCAP];    // storage area
	int    head = NONE;     // index of first list item

	int    stored = 0;      // how many stored (n)
	
	tItemType  value;

	// Store input values in order in list
	cin >> value;
	while (cin)
	{
		insert(value, list, head, stored, MAXCAP);
		cin >> value;
	}
	
	// Print out the (ordered) list values
	cout << stored << " items stored:" << endl;
	traverse(list, head);
	
	return 0;
}