title: How to divide list into 3 sections that are equal in length(sort of) - Python
body: <p>Ok so like lets say a list of length n. n>= 5</p>
  
  <p>I have to choose two index's in the list that will be the cutting point. These 2 elements will be removed as the list will become 3 new lists.</p>
  
  <p>There will be 3 sections: A , B and C.
  A must be bigger or equal to B. and B must be bigger or equal to C. The difference between all 3 sections can only be a maximum of one. With these restrictions what is the formula in finding the 2 index's of a list with the length n? </p>
  
  <p>For Example a list with 5 elements. The 2 index's would be index 1 and index 3.</p>
  
  <p><code>[1,2,3,4,5] = &gt; [1] [3] [5]</code> with 2 and 4 being the elements that were removed due to the specific index's being cut.</p>
  
  <p>A bigger list with the length of 19 for example</p>
  
  <p><code>[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19]</code> The index's that will be the cutting points are index 6 and index 13. </p>
  
  <p>The 3 new formed lists will be <code>[1,2,3,4,5,6]</code> <code>[8,9,10,11,12,13]</code> and <code>[15,16,17,18,19]</code>. You can see that the first two are bigger than the last one as the rules state and the difference in length between each list is not bigger than 1.</p>