Forest Road - Javascript Tasks2

// Forest Road
// Geeko, a non-stop learning trainee at Telerik Software Academy lived deep into the Lyulin forests. Every time he went to the Academy he had to take a long trip through the forest. Starting from the top left corner of the forest, the road always goes down and right first and when it reaches the border, it goes down and left.
// The Academy is situated in the bottom left corner, and Geeko begins his journey from the top left corner of the forest (see the examples below).
// He wanted to make a program that generates a map of the forest but he couldn’t. Help Geeko on his way to the Academy by writing the program instead of him.
// Input
// Read from the standard input
// On the only line in the console you are given an integer number N, showing the width of the map.
// The map’s height is always 2*N - 1.
// The input data will always be valid and in the format described. There is no need to check it explicitly.
// Output
// Print to the standard output
// You should print the whole map on the standard output
// Use the symbol “*” (asterisk) to mark Geeko’s path and “.” (dot) to illustrate the trees
// Constraints
// The number N is a positive integer between 2 and 79, inclusive.
// Allowed working time for your program: 0.25 second.
// Input Output
// 4
// *...
// .*..
// ..*.
// ...*
// ..*.
// .*..
// *...

// 5
// *....
// .*...
// ..*..
// ...*.
// ....*
// ...*.
// ..*..
// .*...
// *....
const input = ['79'];
const print = this.print || console.log;
const gets = this.gets || ((arr, index) => () => arr[index++])(input, 0);
const forestNumber = +gets();
for (let i = 0; i <= forestNumber - 1; i++) {
  const downRight = [];
  for (let j = 0; j <= forestNumber - 1; j++) {
    downRight.push('.');
  }
  downRight[i] = '*';
  print(downRight.join(''));
}
for (let i = 0; i <= forestNumber - 2; i++) {
  const downLeft = [];
  for (let j = 0; j <= forestNumber - 1; j++) {
    downLeft.push('.');
  }
  downLeft[forestNumber - i - 2] = '*';
  print(downLeft.join(''));
}