Remaining Segments

Alice has a ribbon of length \(L\). She removes a portion of the ribbon of length \(V\) to give as a gift. The remaining part of the ribbon has a total length of \(L - V\). In this problem, you are required to determine the number of segments left over when Alice cuts the remaining ribbon into equal segments of the largest possible integer length.

Note: The problem simplifies to computing \(L - V\), which is the remaining length after the cut.

Input: Two integers \(L\) and \(V\) provided on a single line, separated by space.

Output: A single integer representing \(L - V\).

Example:

Input:
20 7
Output:
13

</p>

inputFormat

The input consists of a single line containing two space-separated integers \(L\) and \(V\), where \(L\) is the initial length of the ribbon and \(V\) is the length of the ribbon removed for the gift.

Constraints and edge cases:

• You can assume that \(L \ge V\).
• Both \(L\) and \(V\) are positive integers.

outputFormat

Output a single integer which is the remaining length of the ribbon: \(L - V\).

## sample

20 7

13