import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while(in.hasNext()){
int x = in.nextInt();
int y = in.nextInt();
if(x==0&&y==0){
break;
}else{
boolean isOk = true;
for(int i=x;i<=y;i++){
int v=i*i+i+41;
if(!isPrime(v)){
isOk = false;
break;
}
}
if (isOk) {
System.out.println("OK");
}else{
System.out.println("Sorry");
}
}
}
}
static boolean isPrime(int n){
for(int i=2;i<=Math.sqrt(n);i++){
if(n%i==0){
return false;
}
}
return true;
}
}
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while(in.hasNext()){
int n = in.nextInt();
int sum = 1;
for(int i=1;i<n;i++){
sum = (sum+1)*2;
}
System.out.println(sum);
}
}
}
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while(in.hasNext()){
int n = in.nextInt();
int[] s = new int[n];
for(int i=0;i<n;i++){
s[i] = in.nextInt();
}
int min = s[0];
int max = s[0];
int sum = s[0];
for(int i=1;i<n;i++){
if (min>s[i]) {
min=s[i];
}
if (max<s[i]) {
max=s[i];
}
sum = sum+s[i];
}
double avg = 1.0*(sum-min-max)/(n-2);
System.out.printf("%.2f", avg);
System.out.println();
}
}
}