public class Solution {
    public int firstNegativeIndex(int[] numbers) {
        // Escribe tu solución aquí
        if(numbers.length == 0) return -1;

        for(int i = 0; i < numbers.length; i++){
            if(numbers[i] < 0){
                return i;
            }
        }

        return -1;
    }
}