import java.lang.*;
import java.util.*;
import neststep.*;

class ParPrefix {

  static public final int n = 1000000;

  static public void main( String argv[] )
  {
    sh int[]</> a = new int[n]</>;  // block-distribution
    int myoffset;

    step {
      for (k=0; k<n; k++)
        a[k] = 1;          // some silly initialization
    }

    // start local clock:
    Date d = new Date();
    long l = d.getTime();

    step {
      forall ( int k, a, 1, , )
         a[k] += a[k-1];
      sum = a[n/#-1];
    }
    combine ( sum<myoffset:+> );

    step {
      forall ( int k, a )
         a[k] += myoffset;
    }
 
    // stop local clock:
    Date dl = new Date();
    long ll = dl.getTime();
    System.out.println("Time: "+ (ll-l) + " msecs");
  }
}