def METHOD_NAME(self):
    for n in range(2, 5):  # tested with upper limit 7, but evaluation is a bit slow then
        e = PermutationSymbol(n)
        assert e.ufl_shape == (n,)*n
        assert eval(repr(e)) == e
        ii = indices(n)
        x = (0,)*n
        nfac = product(m for m in range(1, n+1))
        assert (e[ii] * e[ii])(x) == nfac