Determine the maximum value of a (base ten) positive integer N (with non leading zeroes) such that each of the digits of N, with the exception of the first digit and the last digit, is less than the geometric mean of the two neighboring digits.

*** For an extra challenge, solve this puzzle without the aid of a computer program.