public int positionOfFirstFiveFromBeginning(){
    int result = 0;
    if(first == null){
        return -1;
    }
    Node x = first;
    while(x != null){
        if(x.item == 5.0){
            return result;
        }
        result++;
        x = x.next;
    }
    return result;
}

public int positionOfFirstFiveFromBeginning(){
    int result = 0;
    if(first == null || first.item != 5.0){
        return -1;
    }
    Node x = first;
    while(x != null){
        if(x.item == 5.0){
            return result;
        }
        result++;
        x = x.next;
    }
    return result;
}