All Tracks Math Number Theory Problem

Modulo Inverse
/

Very-Easy

Problem
Editorial
Analytics

You have been a number A. You need to output the inverse of number A modulo \(10^9+7\).

Input Format:

The first and only line contains a single integer A.

Output Format:

Output a single integer denoting the inverse of number A modulo \(10^9+7\).

Constraints:

\( 1 \le A \le 10^4 \).

SAMPLE INPUT
87
SAMPLE OUTPUT
252873565
Time Limit: 1.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB

Best Submission

Similar Problems

Contributors

Initializing Code Editor...
Notifications
View All Notifications

?