Problem Statement  
A Ferrers diagram of the partition of positive number n = a_{1} + a_{2} + ... + a_{k}, for a list a_{1}, a_{2}, ..., a_{k} of k positive integers with a_{1} ≥ a_{2} ≥ ... ≥ a_{k} is an arrangement of n boxes in k rows, such that the boxes are leftjustified, the first row is of length a_{1}, the second row is of length a_{2}, and so on, with the kth row of length a_{k}. Let's call a FIELD diagram of order fieldOrder a Ferrers diagram with a_{1} ≤ fieldOrder, a_{2} ≤ fieldOrder  1, ..., a_{k} ≤ fieldOrder  k + 1, so a FIELD diagram can have a number of rows which is less than or equal to fieldOrder. Your method will be given fieldOrder, it should return the total number of FIELD diagrams of order fieldOrder.  
Definition  
 
Constraints  
  fieldOrder will be between 1 and 30, inclusive  
Examples  
0)  
 
1)  
 
2)  
