PivotOJ

Modern Art 3

시간 제한: 1000ms메모리 제한: 512MB출처: USACO 2021 February GoldBOJ 21230

문제

Having become bored with standard 2-dimensional artwork (and also frustrated at others copying her work), the great bovine artist Picowso has decided to switch to a more minimalist, 1-dimensional style. Her latest painting can be described by a 1-dimensional array of colors of length NN (1N3001 \leq N \leq 300), where each color is specified by an integer in the range 1N1\ldots N.

To Picowso's great dismay, her competitor Moonet seems to have figured out how to copy even these 1-dimensional paintings! Moonet will paint a single interval with a single color, wait for it to dry, then paint another interval, and so on. Moonet can use each of the NN colors as many times as she likes (possibly none).

Please compute the number of such brush strokes needed for Moonet to copy Picowso's latest 1-dimensional painting.

입력

The first line of input contains NN.

The next line contains NN integers in the range 1N1 \ldots N indicating the color of each cell in Picowso's latest 1-dimensional painting.

출력

Output the minimum number of brush strokes needed to copy the painting.

예제

예제 1

입력
10
1 2 3 4 1 4 3 2 1 6
출력
6
코드를 제출하려면 로그인하세요.