The Menger Sponge is a three-dimensional fractal, first described by Karl Menger in 1926.

![Mengers Sponge (Level 0-3)](http://i.imgur.com/V6Rb4Za.jpg)
###### _An illustration of the iterative construction of a Menger sponge_

A method of constructing a Menger Sponge can be visualized as follows:
1. Start from a cube (first part of image).
2. Scale down the cube so that side length is 1/3 of its original, and make 20 copies of it.
3. Place the copies so that they measure the same size as the original cube but without its central parts (next part of image)
4. Repeat the process from step 2 for the new smaller cubes from the previous step.
5. In each iteration (e.g. repeating the last three steps), the effect will be that parts of the cube will be removed, they'll never be added. Menger sponge will always consist of parts will never be removed, regardless of how many iterations you do.

___

An alternative explanation:
1. Start from a cube (first part of image).
2. Devide each cube into 27 equal sized cubes.
3. Remove the middle-cube and the six cubes on each side of the group of 27 cubes (second part of image).
4. Repeat the process from step 2 for the smaller cubes (third and fourth part of image).

## Task
In this kata you will create a function that takes non negative integers (from 0 to n) and return the amount of cubes that the Menger Sponge would have in that specific iteration.


## Example
```
calc_ms(0) == 1
calc_ms(1) == 20
calc_ms(2) == 400
calc_ms(3) == 8000
calc_ms(4) == 160000
calc_ms(5) == 3200000
calc_ms(6) == 64000000
```

Happy coding!

Difficulty: introductory

Starter code:

def calc_ms(n):
	

Solutions:
def calc_ms(n):
  return 20 ** n

def calc_ms(n):
    return pow(20,n)

calc_ms = (20).__pow__

from functools import partial

calc_ms = partial(pow, 20)

from functools import partial
from operator import pow

calc_ms = partial(pow, 20)

def calc_ms(n):
  a = n * '0'
  return int(str(pow(2, n)) + a)

calc_ms=lambda Q:20**Q

def calc_ms(n):
  
  
  v = 2**n
  
  d = 1*10**n
  
  k = v*d
  
  return k
  
  
  


def calc_ms(n):
    res = 1
    while n > 0:
        res *= 20
        n -= 1
    return res

def calc_ms(n):
    number = 1
    x = 0
    while x < n:
        number *= 20
        x += 1
    return number