import java.util.Arrays;

public class Solution {
    public static int triangle(int[] a) {
        int[] sorted = a.clone();
        Arrays.sort(sorted);
        int c = sorted.length;
        if (c < 3) {
            return 0;
        }

        for (int i = 0; i < c - 2; i++) {
            if (sorted[i] > 0 && sorted[i] > (long) sorted[i + 2] - sorted[i + 1]) {
                return 1;
            }
        }

        return 0;
    }
}