text: function showPrimes(n) {
    nextPrime: for (let i = 2; i < n; i++) {
      // check if i is a prime number
      for (let j = 2; j < i; j++) {
        if (i % j == 0) continue nextPrime;
      }
  
      alert(i);
    }
  }
  
  // here we add whiskey
  for (let i = 0; i < 10; i++) {
    let drop = getWhiskey();
    smell(drop);
    add(drop, glass);
  }
  
  // here we add juice
  for (let t = 0; t < 3; t++) {
    let tomato = getTomato();
    examine(tomato);
    let juice = press(tomato);
    add(juice, glass);
  }
  
  // ...
  addWhiskey(glass);
  addJuice(glass);
  
  function addWhiskey(container) {
    for (let i = 0; i < 10; i++) {
      let drop = getWhiskey();
      //...
    }
  }
  
  function addJuice(container) {
    for (let t = 0; t < 3; t++) {
      let tomato = getTomato();
      //...
    }
  }
  
  /**
   * Returns x raised to the n-th power.
   *
   * @param {number} x The number to raise.
   * @param {number} n The power, must be a natural number.
   * @return {number} x raised to the n-th power.
   */
  function pow(x, n) {
    // ...
  }
  