Remove Duplicates from Sorted Array

Problem

You are given a sorted integer array nums, where equal values may appear consecutively. Modify it in place so that every distinct value occurs exactly once, then return the resulting count k.

Your implementation must satisfy all of the following:

• It may use only O(1) additional memory.
• Changes must be made directly to the provided nums array.
• Once k is returned, positions 0 through k - 1 in nums must hold the distinct values, preserving their original order.

Input Format

• A single space-delimited line containing the integers of nums.

Output Format

• Print the integer k, which is the array length after duplicate values are removed.

Constraints

• 0 <= len(nums) <= 3 * 10^4
• -10^4 <= nums[i] <= 10^4
• nums is ordered non-decreasingly

Examples

Example 1

Input:

-2 -2 5

Output:

2

Explanation: The first 2 positions are updated to [-2, 5].

nums = [-2, -2, 5]

2

Example 2

Input:

-3 -3 -1 0 0 4 4

Output:

4

Explanation: The first 4 positions become [-3, -1, 0, 4].

Example

Input: 7 7 9

Output: 2