package yukicoder; import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; import java.util.Scanner; public class Main{ public static void main(String[] args)throws Exception{ new Main().solve(); } long[] F01; long[] F10; ArrayList cand=new ArrayList(); void solve(){ Scanner sc=new Scanner(System.in); F01=new long[100]; F10=new long[100]; F01[1]=1; F10[0]=1; for(int i=2;i<=60;i++){ F01[i]=F01[i-1]+F01[i-2]; F10[i]=F10[i-1]+F10[i-2]; } int[] xs=new int[3]; for(int i=0;i<3;i++)xs[i]=sc.nextInt(); Arrays.sort(xs); if(xs[0]==xs[1]&&xs[1]==xs[2]){ solver(1,xs[0]); cand.sort(new Comparator(){ @Override public int compare(Pair o1, Pair o2) { return o1.A>o2.A?1:o1.Ao2.B?1:o1.B(){ @Override public int compare(Pair o1, Pair o2) { return o1.A>o2.A?1:o1.Ao2.B?1:o1.B(){ @Override public int compare(Pair o1, Pair o2) { return o1.A>o2.A?1:o1.Ao2.B?1:o1.B0&&B/det>0)cand.add(new Pair(A/det,B/det)); } } } class Pair{ long A; long B; Pair(long A,long B){ this.A=A; this.B=B; } } void tr(Object...o){System.out.println(Arrays.deepToString(o));} }