import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
package MyAllgoritmicLib;

public class SimpleNumbers {
	public static boolean[] masInt;

	public static void initSimpleInt(int n) { // âõîäíûå äàííûå
		masInt = new boolean[n + 1];
		for(int i=0; i<=n;i++){
			masInt[i] = true;
		}
		masInt[0] = masInt[1] = false; // åñëè êòî-òî áóäåò èñïîëüçîâàòü ýòè
		// çíà÷åíèÿ
		for (int i = 2; i <= n; ++i) {
			if (masInt[i]) {
				for (int j = i + i; j < n; j += i) {
					masInt[j] = false;
				}
			}
		}
	}

	public static void main(String[] args) {
		initSimpleInt(1000000);
		int col = 0;
		int max = 0;
		for (int i = 0; i < 1000000; i++) {
			if (masInt[i]) {
				col++;
				max = i;
			}
		}
		System.out.println(max);
		System.out.println(col);
	}
}
