#include<map> #include<set> #include<cmath> #include<queue> #include<stack> #include<cstdio> #include<vector> #include<cctype> #include<cstring> #include<utility> #include<cstdlib> #include<iomanip> #include<iostream> #include<algorithm> #define Clear(x) memset(x,0,sizeof(x)) #define fup(i,a,b) for(int i=a;i<b;i++) #define rfup(i,a,b) for(int i=a;i<=b;i++) #define fdn(i,a,b) for(int i=a;i>b;i--) #define rfdn(i,a,b) for(int i=a;i>=b;i--) typedef long long ll; using namespace std; const int inf=0x3f3f3f3f; int read() { char ch=getchar();int ret=0,f=1; while(ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();} while(ch>='0'&&ch<='9'){ret=ret*10+ch-'0';ch=getchar();} return f*ret; } void slove(int n) { rfup(i,2,n) { if(n%i==0){ printf("%d\n",n/i); return; } } } int main() { int n=read(); slove(n); return 0; }