import java.util.Arrays;
public class Task1 {
    int n;
    boolean[] primes = new boolean[n];

    public void fillSieve() {
        Arrays.fill(primes, true);
        primes[0] = primes[1] = false;
        for (int i = 2; i < primes.length; i++) {

            if (primes[i]) {
                for (int j = 2; i * j < primes.length; j++) {
                    primes[i * j] = false;

                }
            }

        }int counter = 0;

        for (int i = 2; i < primes.length; i++) {
            if ((primes[i]) && (primes[i + 2])) {
                if (++counter == 200) {
                    break;
                } System.out.println (i + " " + (i+2));
            }}}}