#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
struct ListNode{
	int value;
	ListNode* next;
};
ListNode* ReverseList(ListNode* pHead){
	ListNode* pReversedHead=NULL;
	ListNode* pNode=pHead;
	ListNode* pPrev=NULL;
	while(pNode!=NULL){
		ListNode* pNext=pNode->next;
		if(pNext==NULL) pReversedHead=pNode;
		pNode->next=pPrev;
		pPrev=pNode;
		pNode=pNext;
	}
	return pReversedHead;
}
int main() {
	
	return 0;
}