Problem:
Score : 300 points

Problem Statement

Snuke loves puzzles.

Today, he is working on a puzzle using S- and c-shaped pieces.
In this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:

Snuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.

Find the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.

Constraints

1 ≤ N,M ≤ 10^{12}

Input

The input is given from Standard Input in the following format:

N M

Output

Print the answer.

Sample Input 1

1 6

Sample Output 1

2

Two Scc groups can be created as follows:

Combine two c-shaped pieces into one S-shaped piece

Create two Scc groups, each from one S-shaped piece and two c-shaped pieces

Sample Input 2

12345 678901

Sample Output 2

175897

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)



import java.util.Scanner;

public class Main {
    public static void main(String[] args)
    {
        int s,c;
        Scanner sc = new Scanner(System.in);
        s = sc.nextInt();
        c = sc.nextInt();
        sc.close();
        int counter = 0;
        if( 2 * s <= c)
        {
            counter += s;
            c -= 2 * s;
            counter += c / 4;
        }
        else
        {
            if(c % 2 == 1)
                c--;
            counter += c / 2;
        }
        System.out.println(counter);
    }
}