Good afternoon all, So I have a quick algebra question for everyone. I am trying to figure out an efficient way of obtaining the edges of a rectangle cuboid. Here is a graphic to demonstrate what I mean: Notice how the edge blocks are green and the center blocks are marked red (pretend this is true for the unseen sides of the cube as well). What I am trying to do is take a cuboid and return a collection of all the blocks that are located on the edges of the cuboid; so with the above example the collection would contain every block that is marked green and none that are marked red. I have thought of a few methods to achieve this, such as taking the high point and using block iterators to grab each block along the same axis for the length of the cuboid and repeating for all the edges, but this just seems inefficient, and my past algebra experience leads me to believe that there is a formula for this… So, anyone know of a method to achieve this goal? Thank you in advance to all who assist with this subject.