package main

func isPalindrome(head *ListNode) bool {
	mArr := make([]int,0)
	for head != nil {
		mArr = append(mArr , head.Val )
		head = head.Next
	}
	for i , n:= 0 , len (mArr) ; i < n/2 ; i ++ {
		if mArr[i] != mArr[n-1-i] {
			return false
		}
	}
	return true
}