title: Find the greatest product of five consecutive digits in the 1000-digit number
body: <p>I would like to know how could I resolve this problem(it's not a school stuff, I program as an hobby, I'm doing the Euler's exercises).
  The problem in my code is this: char c = greatest.charAt(i);
  I wondering how could I see the next i in the greatest.charAt(i).
  I post my code, I thank in advance who will help me.</p>
  
  <pre><code>// Find the greatest product of five consecutive digits in the 1000-digit number
  
  import java.util.*;
  import java.io.*;
  
  public class FIVE
  {
      public static void main(String args[]) 
      {
          try{
  
              String greatest = "73167176531330624919225119674426574742355349194934969835203127745063262395783180169848018694788518438586156078911294949545950173795833195285320880551112540698747158523863050715693290963295227443043557668966489504452445231617318564030987111217223831136222989342338030813533627661428280644448664523874930358907296290491560440772390713810515859307960866701724271218839987979087922749219016997208880937766572733300105336788122023542180975125454059475224352584907711670556013604839586446706324415722155397 53697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450";
              long TheNUMBER = 0; 
              long n = 0;    
              long count = 0;
              long provvisoryBiggest = 0;
              long countZERO = 0;
              long countBLOCK = 0;
              long X = 0; 
  
              for ( int i=0; i &lt; greatest.lenght(); i++)  
              {
                  for(int j=0; j&lt;5; j++)
                  {
                      if(X == 0)
                      {
                          X = 1;
                      }
                      char c = greatest.charAt(i); 
                      n = Character.getNumericValue(c);
                      count++;
                      System.out.println(count + "th number: " + n);
                      X = (X * n );
                      System.out.println("The product is: " + X);
  
                      while (provvisoryBiggest &lt; X)
                      {
                          provvisoryBiggest = X;
                      }
                      while(count == 5) 
                      {
                          System.out.println("Now the biggest one is: " + provvisoryBiggest);
                          count = countZERO;
                          X = countZERO;
                          countBLOCK++;
                          System.out.println("Block number: "+ countBLOCK);
                          System.out.println("------------------------------------");
                      }
                  }
              } 
              }
             catch(ArrayIndexOutOfBoundsException ex) { System.out.println("ARRAY ERROR"); }
             catch(ArithmeticException ex) { System.out.println("MATH ERROR");}
             catch(NumberFormatException ex) { System.out.println("NUMBER FORMAT EXCEPTION");}
             catch(StringIndexOutOfBoundsException ex) { System.out.println("INDEX ERROR"); }
      }}
  </code></pre>