Question
Maximum Number of Exact-Sum Pairs

You are given a sorted array and an integer K. Form as many disjoint pairs as possible such that every pair has sum exactly K.

Input

The first line contains KaTeX can only parse string typed expression and KaTeX can only parse string typed expression. The second line contains KaTeX can only parse string typed expression sorted integers.

Output

Print the maximum number of disjoint valid pairs.

Example
Example:
Input
6 7

1 2 3 4 5 6
Output
3

Online