import lombok.AllArgsConstructor;
import lombok.Data;
import lombok.NoArgsConstructor;


@Data
@AllArgsConstructor
@NoArgsConstructor
public class TestLombok {
    private int id;
    private String name;

    public static void main(String[] args) {
        TestLombok test = new TestLombok(1, "sad");
        System.out.println(test);
        System.out.println(test.getName());
        System.out.println(test.toString());
    }

}

package main

import "fmt"

func drinkChoosing(sNum int, dNum int, sFav map[int]int) int {
	result := 0
	t := 0
	for _, v := range sFav {
		result += v - v % 2
		t += v % 2
	}
	result += t / 2 + t % 2
	return result
}

func main() {
	var sNum, dNum int

	_, err := fmt.Scanln(&sNum, &dNum)
	if err != nil {
		fmt.Println(err)
	}

	sFav := make(map[int]int)
	for k := 0; k < sNum; k++ {
		a := 0
		_, err := fmt.Scanln(&a)
		if err != nil {
			fmt.Println(err)
		}
		sFav[a] ++
	}
	result := drinkChoosing(sNum, dNum, sFav)
	fmt.Println(result)
}

package main

import (
	"fmt"
)

func main() {
	var moveNum, candyNum int

	_, err := fmt.Scanln(&moveNum, &candyNum)
	if err != nil {
	}

	for i := 1; i <= moveNum; i++ {
		j := moveNum - i
		a := (i +1) * i /2
		if a < j {
			continue
		}
		candy := a - j
		if (candy - candyNum) == 0 {
			fmt.Println(j)
		}
	}

}

package main

import (
	"fmt"
)

func main() {
	var moveNum, candyNum int

	_, err := fmt.Scanln(&moveNum, &candyNum)
	if err != nil {
	}

	for i := 1; i <= moveNum; i++ {
		j := moveNum - i
		a := 0
		if i%2 == 0 {
			a = (i + 1) * (i / 2)
		} else {
			a = ((i + 1) / 2) * i
		}
		if a < j {
			continue
		}
		candy := a - j
		if (candy - candyNum) == 0 {
			fmt.Println(j)
		}
	}
}

package main

import (
	"fmt"
)

func candyPut(moveNum int, candyNum int) int {
	var j int
	a := 2*candyNum - moveNum*moveNum - moveNum
	for j = 0; j <= moveNum; j++ {
		if (j*j - 3*j - 2*moveNum*j) == a {
			return j
		}
	}
	return j
}

func main() {
	var moveNum, candyNum int

	_, err := fmt.Scanln(&moveNum, &candyNum)
	if err != nil {
	}

	fmt.Println(candyPut(moveNum, candyNum))
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	input := bufio.NewReader(os.Stdin)
	var num int

	_, err := fmt.Fscanf(input, "%d\n", &num)
	if err != nil {
	}

	for num > 0 {
		num -= 1
		var n, k, j int

		_, err := fmt.Fscanf(input, "%v %v\n", &n, &k)
		if err != nil {
		}

		var arr = make([]int, n)
		var result = make([]string, n)

		for i := 0; i < n; i++ {
			_, err := fmt.Fscanf(input, "%v", &arr[i])
			if err != nil {
			}

			if arr[i]%2 == 1 {
				result[j] = strconv.Itoa(i + 1)
				j++
			}
		}
		_, err = fmt.Fscanf(input, "\n")
		if err != nil {
		}

		if j < k || (j-k)%2 != 0 {
			fmt.Println("NO")
			continue
		}
		fmt.Println("YES")

		total := result[:k-1]
		total = append(total, strconv.Itoa(n))

		fmt.Println(strings.Join(total, " "))
	}
}

    int[] re = new int[2];
    Map<Integer,Integer> map = new HashMap<>();
    for(int i = 0;i < nums.length;i++){
        map.put(nums[i],i + 1);
    }

    for(int i = 0;i < nums.length;i++){
        int sub = target - nums[i];
        if(map.containsKey(sub)){
            re[0] = i;
            re[1] = map.get(sub) - 1;
            if(re[0] == re[1]){
                continue;
            }
            break;
        }
    }
    return re;
}`

docker ps --filter "label=color"

docker inspect --format='{{range .NetworkSettings.Networks}}{{.IPAddress}}{{end}}' $INSTANCE_ID

package main

import "fmt"

func main() {
	var tesNum int

	_, err := fmt.Scanln(&tesNum)
	if err != nil {
	}

	var vKey = 0
	for i := 0; i < tesNum; i++ {
		_, err := fmt.Scanln(&vKey)
		if err != nil {
		}
		var vValue = make([]int, vKey)
		var max = [2] int{0, 0}

		for j := 0; j < vKey; j++ {
			_, err = fmt.Scan(&vValue[j])
			if err != nil {
			}

			if vValue[j] > max[0] {
				max[1] = max[0]
				max[0] = vValue[j]
				continue
			}
			if vValue[j] > max[1] {
				max[1] = vValue[j]
			}
		}

		v1 := max[1] - 1
		v2 := vKey - 2
		if v1 <= v2 {
			fmt.Println(v1)
		} else {
			fmt.Println(v2)
		}
	}
}

if __name__ == "__main__":
    test_num = int(input())
    while test_num:
        test_num -= 1

        arr_num = int(input())
        arr = input()
        num = [int(n) for n in arr.split()]

        num = sorted(num)
        result = min(num[-2] - 1, arr_num - 2)
        print(result)

import java.util.Scanner;
 
public class Cf576A {
 
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n, x, y;
        n = scanner.nextInt();
        x = scanner.nextInt();
        y = scanner.nextInt();
        int[] a = new int[n + 1];
 
        for (int i = 1; i < n + 1; i++) {
            a[i] = scanner.nextInt();
        }
 
        boolean exist = false;
        for (int i = x; i <= n; i++) {
            int minBefore = findMin(a, i - x, x);
            if (a[i] > minBefore) {
                continue;
            }
            if (i + y <= n) {
                int minAfter = findMin(a, i + 1, y);
                if (a[i] > minAfter) {
                    continue;
                }
            }
            System.out.println(i);
            exist = true;
            break;
        }
        if (!exist) {
            System.out.println(n);
        }
 
    }
 
    private static int findMin(int[] a, int startIndex, int num) {
        int min = 999999999;
        for (int i = startIndex; i < startIndex + num; i++) {
            if (min > a[i]) {
                min = a[i];
            }
        }
        return min;
    }
}

    public String replaceAll(String regex, String replacement) {
        return Pattern.compile(regex).matcher(this).replaceAll(replacement);
    }