#include <stdio.h>
#include <stdlib.h>

struct node {
	int value;
	struct node *next;
};

void listPrintReverse(struct node *list);

struct node *readList(void);
struct node *newNode(int value);
void printList(struct node *list);
void freeList(struct node *list);

int main(void) {
	struct node *list = readList();

	printf("List: ");
	printList(list);

	printf("List (reversed): ");
	listPrintReverse(list);
	printf("\n");

	freeList(list);
}

////////////////////////////////////////////////////////////////////////

void listPrintReverse(struct node *list) {
	// TODO
	if (list == NULL) {
		return;
	} else {
		listPrintReverse(list->next);
		printf("%d ", list->value);
	}
}

////////////////////////////////////////////////////////////////////////

struct node *readList(void) {
	struct node *list = NULL;
	struct node *curr = NULL;

	int value = 0;
	while (scanf("%d", &value) == 1) {
		struct node *node = newNode(value);
		if (list == NULL) {
			list = node;
		} else {
			curr->next = node;
		}
		curr = node;
	}

	return list;
}

struct node *newNode(int value) {
	struct node *n = malloc(sizeof(*n));
	if (n == NULL) {
		fprintf(stderr, "error: out of memory\n");
		exit(EXIT_FAILURE);
	}

	n->value = value;
	n->next = NULL;
	return n;
}

void printList(struct node *list) {
	printf("[");
	for (struct node *curr = list; curr != NULL; curr = curr->next) {
		printf("%d", curr->value);
		if (curr->next != NULL) {
			printf(", ");
		}
	}
	printf("]\n");
}

void freeList(struct node *list) {
	struct node *curr = list;
	while (curr != NULL) {
		struct node *temp = curr;
		curr = curr->next;
		free(temp);
	}
}