Yet Another Palindrome Problem

Given an array $A$ of $N$ positive integers, find the minimum number of moves to make $A$ empty. In one move you are allowed to choose a palindromic subarray and remove it. (After removal the remaining elements form a single array) Note: An array (or subarray) is palindromic if it reads the same forwards and backwards. ### Input - The first line of input will contain a single integer $N$, denoti