Coprimes
Problem
You are provided an integer \(n\). Your task is to determine the largest integer \(a\) (\(a<n-1\)) that is a coprime of \(n\). This implies that \(gcd(a,n)=1\).
Input format
A single line that contains an integer \(n\)
Output format
Print the answer to the question.
Constraints
\(3 \leq n \leq 10^{3}\)
Time Limit: 1
Memory Limit: 256
Source Limit:
Explanation
Largest integer less than 3 (n-1), coprime with 4 is 1
