B. Divisor Subtraction

http://codeforces.com/contest/1076/problem/B

题意：有操作：1,n==0退出，2,n-最小的素因子，3，步数加一；问最小步数；

思路：写几个就发现规律；减掉他第一个素因子就是二大倍数了； 

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=998244353;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return ans;
}


int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    ll n;
    cin>>n;
    bool f=1;
    ll p=0;
    for(int i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
        {
            p=i;
            f=0;
            break;
        }
    }
    if(f)
    {
        cout<<1<<endl;
    }
    else
    {
        ll ans=1;
        n-=p;
        cout<<n/2+ans<<endl;
    }
	return 0;
}