codeparrot/codecomplex huggingface dataset:
// Problem: 25_A. IQ test
// Time complexity: linear

import java.util.Scanner;

public class Main {

    /**
     * @param args
     */
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] nums = new int[n];
        int kisu = 0;
        int gusu = 0;
        for(int i = 0 ; i < n ; i++){
            nums[i] = sc.nextInt();
            if(nums[i] % 2 == 0)gusu++;
            if(nums[i] % 2 == 1)kisu++;
        }
        int ans = -1;
        if(gusu == 1){
            for(int i = 0 ; i < n ; i++){
                if(nums[i]%2 == 0){
                    ans = i+1;
                    break;
                }
            }
        }
        else{
            for(int i = 0 ; i < n ; i++){
                if(nums[i]%2 == 1){
                    ans = i+1;
                    break;
                }
            }
            
        }
        System.out.println(ans);
    }

}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.util.*;

public class A {

    int n;
    int[] arr;
    
    void run(){
        Scanner s = new Scanner(System.in);
        n = s.nextInt();
        arr = new int[n];
        int even, odd;
        even = 0;
        odd = 0;
        for (int i = 0; i < n; i++) {
            arr[i] = s.nextInt();
            if(arr[i]%2==0)even++;
            else odd++;
        }
        if(even>odd){
        
            
            for (int i = 0; i < n; i++) {
                if(arr[i]%2==1){
                    System.out.println(i+1);
                    System.exit(0);
                }
            }
        }
        
        else{

            for (int i = 0; i < n; i++) {
                if(arr[i]%2==0){
                    System.out.println(i+1);
                    System.exit(0);
                }
            }

        }
        
        
    }
    public static void main(String[] args) {
        new A().run();
    }
}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;


public class ProblemA {

	public static void main(String[] args) throws Exception{
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter writer = new PrintWriter(System.out);
		int n = Integer.parseInt(reader.readLine());
		String [] split = reader.readLine().split("\\s+");
		int value;
		int [] count = new int[2];
		int [] pos = new int[2];
		for(int i = 0; i < split.length; i++){
			value = Integer.parseInt(split[i]);
			count[value % 2] ++;
			pos[value % 2] = i + 1;
		}
		writer.println((count[0] == 1) ? pos[0] : pos[1]);
		writer.flush();
		writer.close();
	}

}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.util.Scanner;
import static java.lang.Math.*;
import static java.lang.Integer.*;
import static java.lang.Long.*;
import static java.util.Arrays.*;

public class A {

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        while (s.hasNext()) {
            int n = s.nextInt();
            int[] a = new int[n];
            int odd = 0;
            int even = 0;
            int po = -1;
            int ev = -1;
            for(int i=0;i<n;i++){
                a[i] = s.nextInt();
                if(a[i] % 2 == 0) {
                    even ++;
                    ev = i + 1;
                } else {
                    odd++;
                    po = i + 1;
                }
            }
            if(odd == 1) {
                System.out.println(po);
            }else{
                System.out.println(ev);
            }
        }
    }
}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;


public class Main {
private static StreamTokenizer in;
private static PrintWriter out;
private static int nextInt() throws Exception {
in.nextToken();
return (int)in.nval;
}
private static String nextString() throws Exception {
in.nextToken();
return in.sval;
}

public static void main(String[] args) throws Exception {
in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
out = new PrintWriter(System.out);
int n = nextInt();
byte f = (byte)nextInt();
byte s = (byte)nextInt();
byte t = (byte)nextInt();
boolean bf = false;
boolean bs = false;
boolean bt = false;
if((f&1) == 0){bf = true;}
if((s&1) == 0){bs = true;}
if((t&1) == 0){bt = true;}
//System.out.println(bf+""+bs+""+bt);
if((!bf)&&bs&&bt){System.out.println(1);return;}
if(bf&&(!bs)&&bt){System.out.println(2);return;}
if(bf&&bs&&(!bt)){System.out.println(3);return;}
if(bf&&!bs&&!bt){System.out.println(1);return;}
if(!bf&&bs&&!bt){System.out.println(2);return;}
if(!bf&&!bs&&bt){System.out.println(3);return;}
for(int i = 4; i<=n; i++){
byte g = (byte) nextInt();
if(((g+f)&1) == 1){System.out.println(i); return;}
}



out.flush();
}
}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.List;
import java.util.Queue;
import java.awt.*;
import static java.util.Arrays.fill;

public class Solution implements Runnable {

    private BufferedReader br = null;
    private PrintWriter pw = null;
    private StringTokenizer stk = new StringTokenizer("");

    public static void main(String[] args) {
        new Thread(new Solution()).run();
    }

    public void run() {
        /*
         * try { // br = new BufferedReader(new FileReader("input.txt")); pw =
         * new PrintWriter("output.txt"); } catch (FileNotFoundException e) {
         * e.printStackTrace(); }
         */
        br = new BufferedReader(new InputStreamReader(System.in));
        pw = new PrintWriter(new OutputStreamWriter(System.out));
        solver();
        pw.close();

    }

    private void nline() {
        try {
            if (!stk.hasMoreTokens())
                stk = new StringTokenizer(br.readLine());
        } catch (IOException e) {
            throw new RuntimeException("KaVaBUnGO!!!", e);
        }
    }

    private String nstr() {
        while (!stk.hasMoreTokens())
            nline();
        return stk.nextToken();
    }

    private int ni() {
        return Integer.valueOf(nstr());

    }

    private double nd() {
        return Double.valueOf(nstr());

    }

    String nextLine() {
        try {
            return br.readLine();
        } catch (IOException e) {
        }
        return null;
    }

    private void solver() {
        int n = ni();
        ArrayList<Integer> ar = new ArrayList<Integer>();
        int sum = 0;
        for (int i = 0; i < n; i++) {
            ar.add(ni() % 2);
            sum += ar.get(i);
        }
        int flag = 0;
        if(sum==1)flag = 1;
            for(int i =0;i<n;i++)if(ar.get(i)==flag)System.out.println(i+1);
        

    }

    void exit() {
        System.exit(0);
    }
}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.io.*;
public class Main {
	public static void main (String [] args) throws IOException {
		BufferedReader br = new BufferedReader (new InputStreamReader (System.in));
		do {
			int n = Integer.parseInt (br.readLine ());
			//args;
			int [] ns = new int [(args = br.readLine ().split (" ")).length];
			int evenCount = 0, oddCount = 0, evI = 1, oddI = 1;
			for (int i = 0; i < ns.length; i++) {
				if ((ns [i] = Integer.parseInt (args [i])) % 2 == 0) {
					evenCount ++;
					evI = i;
					
				} else {
					oddCount ++;
					oddI = i;
				}
			}
			if (evenCount == 1) System.out.println (evI + 1);
			else System.out.println (oddI + 1);
		} while (br.ready ());
	}
}
// Problem: 25_A. IQ test
// Time complexity: linear
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author Saransh
 */
import java.util.*;
import java.io.*;
import java.math.*;
import java.lang.*;
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        try
        {
            Parserdoubt pd=new Parserdoubt(System.in);
            int t=pd.nextInt();
            int inde=0,indo=0,o=0,e=0;
            for(int i=0;i<t;i++)
            {
                if(pd.nextInt()%2==0)
                {
                    inde=i;
                    e++;
                }
                else
                {
                    o++;
                    indo=i;
                }
            }
            if(o==1)
            {
                System.out.println(indo+1);
            }
            else
            {
                System.out.println(inde+1);
            }
        }
        catch(Exception e){}
    }

}

class Parserdoubt
	{
	   final private int BUFFER_SIZE = 1 << 17;

	   private DataInputStream din;
	   private byte[] buffer;
	   private int bufferPointer, bytesRead;

	   public Parserdoubt(InputStream in)
	   {
	      din = new DataInputStream(in);
	      buffer = new byte[BUFFER_SIZE];
	      bufferPointer = bytesRead = 0;
	   }
	   public String nextString() throws Exception
	   {
		   StringBuffer sb=new StringBuffer("");
		   byte c = read();
		   while (c <= ' ') c = read();
		   do
		   {
			   sb.append((char)c);
			   c=read();
		   }while(c>' ');
		   return sb.toString();
	   }
	   public char nextChar() throws Exception
	   {
		   byte c=read();
		   while(c<=' ') c= read();
		   return (char)c;
	   }
	   public int nextInt() throws Exception
	   {
	      int ret = 0;
	      byte c = read();
	      while (c <= ' ') c = read();
	      boolean neg = c == '-';
	      if (neg) c = read();
	      do
	      {
	    	  ret = ret * 10 + c - '0';
	         c = read();
	      } while (c > ' ');
	      if (neg) return -ret;
	      return ret;
	   }
	   public long nextLong() throws Exception
	   {
	      long ret = 0;
	      byte c = read();
	      while (c <= ' ') c = read();
	      boolean neg = c == '-';
	      if (neg) c = read();
	      do
	      {
	    	  ret = ret * 10 + c - '0';
	         c = read();
	      } while (c > ' ');
	      if (neg) return -ret;
	      return ret;
	   }
	   private void fillBuffer() throws Exception
	   {
	      bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
	      if (bytesRead == -1) buffer[0] = -1;
	   }

	   private byte read() throws Exception
	   {
	      if (bufferPointer == bytesRead) fillBuffer();
	      return buffer[bufferPointer++];
	   }
	}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.util.Scanner;


public class A {
  public static void main(String[] args){
	  Scanner in = new Scanner(System.in);
	  int n = in.nextInt();
	  int a[] = new int[100];
	  for (int i = 0;i<n;i++) a[i] = in.nextInt()%2;
	  if (a[0]==a[1] || a[0]==a[2]){
		  for (int i = 1;i<n;i++)
			  if (a[i] != a[0]) {
				  System.out.println(i+1);
				  break;
			  }
	  } else{
		  System.out.println(1);
	  }
  }
}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.io.*;
import java.util.*;

public class Main implements Runnable {

	public void _main() throws IOException {
		int n = nextInt();
		int even = 0, odd = 0, atEven = -1, atOdd = -1;
		for (int i = 0; i < n; i++) {
			if (nextInt() % 2 == 0) {
				atEven = i;
				++even;
			}
			else {
				atOdd = i;
				++odd;
			}
		}
		if (odd == 1)
			out.print(atOdd + 1);
		else
			out.print(atEven + 1);
	}

	private BufferedReader in;
	private PrintWriter out;
	private StringTokenizer st;

	private String next() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			String rl = in.readLine();
			if (rl == null)
				return null;
			st = new StringTokenizer(rl);
		}
		return st.nextToken();
	}

	private int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	private long nextLong() throws IOException {
		return Long.parseLong(next());
	}

	private double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}

	public static void main(String[] args) {
		new Thread(new Main()).start();
	}

	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);

			_main();

			out.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(202);
		}
	}

}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;


public class IQTest {
	public static void main(String args[]) throws Exception {
		BufferedReader stdin =
			new BufferedReader(new InputStreamReader(System.in));
		String line;
			line = stdin.readLine();
			int n = Integer.parseInt(line);
			line = stdin.readLine();
			List even = new ArrayList();
			List odd = new ArrayList();
			String[] kk = line.split(" ");
			for(int i=0;i<n;i++) {
				if(Integer.parseInt(kk[i])%2==0)
					even.add(i);
				else
					odd.add(i);
			}
			if(even.size()==1)
				System.out.println((Integer)even.get(0)+1);
			else
				System.out.println((Integer)odd.get(0)+1);
	}
}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.ArrayList;

public class A {
	private static StreamTokenizer in;
	private static PrintWriter out;

	private static int nextInt() throws Exception {
		in.nextToken();
		return (int) in.nval;
	}

	private static String nextString() throws Exception {
		in.nextToken();
		return in.sval;
	}

	public static void main(String[] args) throws Exception {
		in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
		out = new PrintWriter(System.out);
		
		ArrayList<Integer> p = new ArrayList<Integer>();
		ArrayList<Integer> o = new ArrayList<Integer>();
		
		int n = nextInt();
		for (int i=0; i<n; i++) {
			int a = nextInt();
			if (a % 2 == 0) p.add(i+1);
			else o.add(i+1);
		}
		
		if (p.size() < o.size()) out.println(p.get(0));
		else out.println(o.get(0));

		out.flush();

	}
}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;

public class A25 {

	static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
	static PrintWriter out = new PrintWriter(System.out);
	
	static int nextInt() throws Exception {
		in.nextToken();
		return (int)in.nval;
	}
	
	static String nextString() throws Exception {
		in.nextToken();
		return in.sval;
	}
	
	public static void main(String[] args) throws Exception {
		int n = nextInt();
		int[] c = new int[2];
		int[] f = new int[2];
		for (int i = 0; i < n; i++) {
			int x = nextInt(), p = x%2;
			if (c[p]++ == 0) f[p] = i+1;
		}
		out.println(c[0] == 1 ? f[0] : f[1]);
		
		out.flush();
	}

}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.util.*;

public class Task25a {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a1 = 0, a2 = 0;
		int n1 = 0, n2 = 0;
		for (int i = 1; i <= n; i++) {
			int c = sc.nextInt();
			if (c % 2 == 1) {
				a1 = i;
				n1++;
			} else {
				a2 = i;
				n2++;
			}
		}
		if (n1 == 1) {
			System.out.println(a1);
		} else {
			System.out.println(a2);
		}
	}

}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class IQTest implements Runnable
{
  public static void main(String[] args) throws Exception
  {
    new IQTest().run();
  }

  private void solve() throws Exception
  {
    int n = nextInt();
    int a[] = new int[n];
    for (int i = 0; i < a.length; i++)
    {
      a[i] = nextInt();
    }

    int c0 = 0, c1 = 0;
    for (int i = 0; i < a.length; i++)
    {
      a[i] = a[i] % 2;
      if (a[i] == 0)
        c0++;
      else
        c1++;
    }

    int f = 0;
    if (c0 > c1)
      f = 1;
    else
      f = 0;

    int r = 0;
    for (int i = 0; i < a.length; i++)
    {
      if (a[i] == f)
      {
        r = i + 1;
        break;
      }
    }
    out.println(r);
  }

  // -------------- Input/Output routines below ---------------//
  private BufferedReader in;
  PrintWriter out;
  StringTokenizer tokenizer;

  public void run()
  {
    // String problem = this.getClass().getName();
    try
    {
      in = new BufferedReader(new InputStreamReader(System.in));
      out = new PrintWriter(new BufferedOutputStream(System.out));
      solve();
      out.flush();
      in.close();
      out.close();
    }
    catch (Exception e)
    {
      e.printStackTrace();
      // System.exit(1);
    }
  }

  String nextToken() throws IOException
  {
    while (tokenizer == null || !tokenizer.hasMoreTokens())
    {
      tokenizer = new StringTokenizer(in.readLine());
    }
    return tokenizer.nextToken();
  }

  int nextInt() throws IOException
  {
    return Integer.parseInt(nextToken());
  }

  long nextLong() throws IOException
  {
    return Long.parseLong(nextToken());
  }

  double nextDouble() throws IOException
  {
    return Double.parseDouble(nextToken());
  }

}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.util.Scanner;



public class R025A {
	int n;
	int[] nums;
	public R025A() {
		Scanner scanner = new Scanner(System.in);
		n = scanner.nextInt();
		nums = new int[n];
		for(int i=0; i<n; i++) {
			nums[i] = scanner.nextInt();
		}
	}

	private void process() {
		int odd = 0;
		int even = 0;
		int lastOdd = 0;
		int lastEven = 0;
		for(int i=0; i<n; i++) {
			if(nums[i] % 2 == 0) {
				even++;
				lastEven = i+1;
			} else {
				odd++;
				lastOdd = i+ 1;
			}
		}
		if(odd == 1) System.out.println(lastOdd);
		else System.out.println(lastEven);
	}

	public static void main(String[] args) {
		new R025A().process();
	}
}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.util.Locale;
import java.util.Scanner;

public class A {
	public static void main(String[] args) {
		Locale.setDefault(Locale.US);
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		String[] number = new String[n];
		sc.nextLine();
		String l = sc.nextLine();
		number = l.split(" ");
		int oe = 1;
		if((Integer.valueOf(number[0])%2 +
		   Integer.valueOf(number[1])%2 +
		   Integer.valueOf(number[2])%2) > 1) {
			oe = 0;
		}
		for(int i=0;i<n;i++) {
			if((Integer.valueOf(number[i])%2)==oe) {
				System.out.println(i+1);
				break;
			}
		}
	}
}
// Problem: 25_A. IQ test
// Time complexity: linear
//package codeforces.br25;

import java.io.*;
import java.math.*;
import java.util.*;

public class ProblemA {
    public void solve() {
        boolean oj = true;

        try {
            Reader reader = oj ? new InputStreamReader(System.in) : new FileReader("A.in");
            Writer writer = oj ? new OutputStreamWriter(System.out) : new FileWriter("A.out");
            BufferedReader br = new BufferedReader(reader);
            StreamTokenizer st = new StreamTokenizer(reader);
            PrintWriter out = new PrintWriter(writer);

            int n = Integer.valueOf(br.readLine());
            String s = br.readLine();
            MyTokenizer tok = new MyTokenizer(s);
            int[] a = new int[2];
            int[] ind = new int[2];
            int[] c = new int[2];

            for(int i=0;i<n;i++) {
                int p = (int)tok.getNum();
                c[p%2]++;
                a[p%2] = p;
                ind[p%2] = i;
            }
            int b = ind[0];
            if (c[0] > c[1])
                b = ind[1];
            out.printf("%d", b + 1);

            br.close();
            out.close();
            reader.close();
            writer.close();
        }
        catch (Exception ex) {
            ex.printStackTrace();
        }
        finally {
        }
    }


    public static void main(String[] args) {
        ProblemA f = new ProblemA();
        f.solve();
    }

    private class MyTokenizer {
        private String s;
        private int cur;

        public MyTokenizer(String s) {
            this.s = s;
            cur = 0;
        }

        public void skip() {
            while (cur < s.length() && (s.charAt(cur) == ' ' || s.charAt(cur) == '\n')) {
                cur++;
            }
        }

        public double getNum() {
            skip();
            String snum = "";
            while (cur < s.length() && (s.charAt(cur) >= '0' && s.charAt(cur) <= '9' || s.charAt(cur) == '.' || s.charAt(cur) == '-')) {
                snum += s.charAt(cur);
                cur++;
            }
            return Double.valueOf(snum);
        }

        public String getString() {
            skip();
            String s2 = "";
            while (cur < s.length() && (((s.charAt(cur) >= 'a' && s.charAt(cur) <= 'z')) || ((s.charAt(cur) >= 'A' && s.charAt(cur) <= 'Z')))) {
                s2 += s.charAt(cur);
                cur++;
            }
            return s2;
        }

        public char getCurrentChar() throws Exception {
            if (cur < s.length())
                return s.charAt(cur);
            else
                throw new Exception("Current character out of string length");
        }

        public void moveNextChar() {
            if (cur < s.length())
                cur++;
        }

        public boolean isFinished() {
            return cur >= s.length();
        }
    }
}
// Problem: 25_A. IQ test
// Time complexity: linear
import java.io.*;
import java.util.*;

public class A {
	
	int n;
	
	void run()throws IOException{
		Scanner sc = new Scanner(new InputStreamReader(System.in));		
		n = sc.nextInt();
		int i,tmp,even,odd,e,o;
		even=odd=e=o=0;
		for(i=1;i<=n;i++){
			tmp = sc.nextInt();
			if(tmp%2==0){
				e++;
				if(even==0) even=i;
			} else{
				o++;
				if(odd==0) odd=i;
			}
		}
		if(e>1) System.out.println(odd);
		else System.out.println(even);
	}
	
	public static void main(String[] args)throws IOException {
		new A().run();
	}
}
// Problem: 25_A. IQ test
// Time complexity: linear
import static java.util.Arrays.*;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import java.util.*;
import java.math.*;
import java.io.*;

public class A implements Runnable
{
	String file = "input";
	
	void init() throws IOException
	{
		//input = new BufferedReader(new FileReader(file + ".in"));
		input = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(new BufferedOutputStream(System.out));
	}
	
	void solve() throws IOException
	{
		int odd = 0, even = 0;
		int n = nextInt();
		int[] a = new int[n];
		for(int i = 0; i < n; i++) 
		{
			a[i] = nextInt();
			if(a[i] % 2 == 0) even++;
			else odd++;
		}
		if(even >= 2)
		{
			for(int i = 0; i < n; i++) if(a[i] % 2 == 1)
			{
				System.out.println(i + 1);
				return;
			}
		}
		else
		{
			for(int i = 0; i < n; i++) if(a[i] % 2 == 0)
			{
				System.out.println(i + 1);
				return;
			}
		}
	}
	
	String next() throws IOException
	{
		while(st == null || !st.hasMoreTokens()) st = new StringTokenizer(input.readLine());
		return st.nextToken();
	}
	
	int nextInt() throws IOException
	{
		return Integer.parseInt(next());
	}
	
	long nextLong() throws IOException
	{
		return Long.parseLong(next());
	}
	
	double nextDouble() throws IOException
	{
		return Double.parseDouble(next());
	}
	
	void print(Object... o)
	{
		System.out.println(deepToString(o));
	}
	
	void gcj(Object o)
	{
		String s = String.valueOf(o);
		out.println("Case #" + test + ": " + s);
		System.out.println("Case #" + test + ": " + s);
	}
	
	BufferedReader input;
	PrintWriter out;
	StringTokenizer st;
	int test;
	
	public static void main(String[] args) throws IOException
	{
		new Thread(null, new A(), "", 1 << 20).start();
	}
	
	public void run()
	{
		try
		{
			init();
			solve();
			out.close();		
		}
		catch(Exception e)
		{
			e.printStackTrace();
			System.exit(1);
		}
	}
}