while (start)
	{
		Node *n = (Node *)malloc(sizeof(Node));
		Node *t = (Node *)malloc(sizeof(Node));
		n -> value = start -> value + val;
		 ---list = addToBack(list, n);
		n = n->next;
		start = start -> next;
	}