#!/usr/bin/perl
use strict;

sub isPrime($){
  if ($_[0] < 2) { return 0; }
  my $isprime = 1;
  for (my $j = 2; ($j <= $_[0]/2) && ($isprime); $j++) {  
    if ($_[0] % $j == 0) {
      $isprime = 0;
    }
  }
  return $isprime;
}

print "a=prime, b=prime, n=integer>2\n";
print "(a+b^n)/n="; my $X = <STDIN>; chomp($X);
for (my $n = 3; (($X*$n) > 2**$n +1); $n++) {
  for (my $a, $b = 2; ($X*$n) > $b**$n +1; $b++) {
    if (not &isPrime($b)) { next; }
    if ( &isPrime($a=($X*$n)-$b**$n) ) {
      print "{a, b, n}={", $a, ", ", $b, ", ", $n, "}\n";
    }
  }
}