# Social Distancing

## 문제

It's time for a social distancing party! A group of friends are sitting around a circular table where some seats are filled and some seats are empty. In particular, to maintain social distancing protocols, no two people are sitting directly beside each other.

They want to expand the party and include more friends, but no one is willing to move out of their current seat. Given the current table seating, determine the maximum number of additional people that can be seated such that there is still at least one empty seat between all pairs of people seated.

## 입력

The first line of input contains two integers S (3≤S≤1 000), which is the number of seats at the table, and N (1≤N≤S/2), which is the number of people that are already seated at the table.

Note that the seats of the table are numbered 1,2,…,S in a circular fashion: for each 1≤i<S, seats numbered i and i+1 are directly beside each other. Seats S and 1 are also directly beside each other.

The second line contains N integers a 1,a 2,…,aN (1≤a 1<a 2<⋯<aN≤S), which indicates that seat number a i is currently occupied. No two occupied seats are directly beside each other.

## 출력

Display the maximum number of additional friends that can be seated at the table such that there is still at least one empty seat between all pairs of people seated.

## 예제 입력 1 복사

    9 2
    2 6

## 예제 입력 2 복사

    10 3
    1 4 7

## 예제 입력 3 복사

    6 2
    2 5

## 예제 입력 4 복사

    100 5
    7 14 47 78 99

## 예제 입력 5 복사

    6 1
    3

## 예제 출력 1 복사

    2

## 예제 출력 2 복사

    1

## 예제 출력 3 복사

    0

## 예제 출력 4 복사

    43

## 예제 출력 5 복사

    2