sub is_odd_prime {
  return unless $_[0] % 2;
  my @x = (`factor $_[0]` =~ / /g);
  return @x == 1;
}

for my $n (1 .. 1000000) {
  next if $n % 2;

  my $found = 0;
  for my $p (3 .. $n) {
    next unless is_odd_prime($p);
    my $q = $n - $p;
    next unless is_odd_prime($q);
    next unless is_odd_prime(($p - 1)/2) || is_odd_prime(($q - 1) / 2);
    $found = 1;
    last;
  }

  print "$n\n" unless $found;
}