Additive and multiplicative inverses

Let $Z_N$ be the set of integers from $0$ to $N-1$. For $a, b, c \in Z_N$, $b$ is the additive inverse of $a$ if $(a + b) \bmod N = 0$, and $c$ is the multiplicative inverse of $a$ if $(a \times c) \bmod N = 1$.

You are given integers $N$ and $A$. Find the additive inverse and the multiplicative inverse of $A$ in $Z_N$. If the multiplicative inverse does not exist, print $-1$ for it.

The first line contains $N$ ($2 \le N \le 10^{12}$) and $A$ ($1 \le A < N$), separated by a space.

Print the additive inverse and the multiplicative inverse of $A$ in $Z_N$ on one line, separated by a space. If the multiplicative inverse does not exist, print $-1$ in its place.

Both inverses are integers in the range $0$ to $N-1$, and each of them is unique when it exists.

For $N = 26$ and $A = 11$, the additive inverse is $15$ because $(11 + 15) \bmod 26 = 0$, and the multiplicative inverse is $19$ because $(11 \times 19) \bmod 26 = 1$.