蓝桥杯 算法提高 拿糖果

import java.util.Scanner;
public class Main {

    static int sum = 0;//sum-->一共可以拿走的糖果数

    public static boolean Su(int num) {
        for(int i = 2;i < num / 2;i ++) {
            if(num % i == 0) {
                return false;
            }
        }
        return true;
    }

    public static void tangguo(int num) {
        int flag = 0;
//      System.out.println(Math.sqrt(num));
        for(int i = 2;i <= Math.sqrt(num);i++) {
            if(Su(i) == true) {
                flag = i;//每次可以拿走的糖果数
            }
        }
        if(flag == 0) {
            return;
        }
        sum += flag;
//      System.out.println(flag);
        tangguo(num - flag * 2);
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int num = sc.nextInt();
        tangguo(num);
        System.out.println(sum);
    }
}