// C++ program to find minimum steps to reach
// starting position in a circular tour.
#include<bits/stdc++.h>
using namespace std;
// function for finding minimum steps
int minStroke(int n, int m)
{
// return value n / gcd(n, m)
return (n/__gcd(n, m));
}
// Driver function
int main()
{
int n = 11, k = 2, m = 5;
cout << minStroke(n, m);
return 0;
}
Ly8gQysrIHByb2dyYW0gdG8gZmluZCBtaW5pbXVtIHN0ZXBzIHRvIHJlYWNoIAovLyBzdGFydGluZyBwb3NpdGlvbiBpbiBhIGNpcmN1bGFyIHRvdXIuIAojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPiAKdXNpbmcgbmFtZXNwYWNlIHN0ZDsgCgovLyBmdW5jdGlvbiBmb3IgZmluZGluZyBtaW5pbXVtIHN0ZXBzIAppbnQgbWluU3Ryb2tlKGludCBuLCBpbnQgbSkgCnsgCgkvLyByZXR1cm4gdmFsdWUgbiAvIGdjZChuLCBtKSAKCXJldHVybiAobi9fX2djZChuLCBtKSk7IAp9IAoKLy8gRHJpdmVyIGZ1bmN0aW9uIAppbnQgbWFpbigpIAp7IAoJaW50IG4gPSAxMSwgayA9IDIsIG0gPSA1OyAKCWNvdXQgPDwgbWluU3Ryb2tlKG4sIG0pOyAKCXJldHVybiAwOyAKfSAK