Create a function
```python
has_two_cube_sums(n)
```
which checks if a given number `n` can be written as the sum of two cubes in two different ways: `n = a³+b³ = c³+d³`.
All the numbers `a`, `b`, `c` and `d` should be different and greater than `0`.
E.g. 1729 = 9³+10³ = 1³+12³.
```python
has_two_cube_sums(1729); // true
has_two_cube_sums(42);   // false
```
def has_two_cube_sums(n):
    if n == 1: return False
    
    high = int((n)**(1/3.0))
    low  = int((n/2)**(1/3.0))
    return sum( abs(y-round(y)) < 1e-8 for y in [((n-x**3))**(1/3.0) for x in range(low,high+1)]) >= 2
def has_two_cube_sums(n):
    if n == 1: return False
    
    high = int((n)**(1/3.0))
    low  = int((n/2)**(1/3.0))
    return sum( abs(y-round(y)) < 1e-8 for y in [((n-x**3))**(1/3.0) for x in range(low,high+1)]) >= 2