Create barn1.java

A simple way of doing this would be:
Keep barn_num[] and find the biggest gap between unoccupied stalls.

This solution is toooo complex.