<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def inelpl(ellips, plane):
 """ Find the intersection of an ellipse and a plane. http://naif.jpl.nasa.gov/pub/naif/toolkit_docs/C/cspice/inelpl_c.html :param ellips: A SPICE ellipse. :type plane: spiceypy.utils.support_types.Ellipse :param plane: A SPICE plane. :type plane: spiceypy.utils.support_types.Plane :return: Number of intersection points of plane and ellipse, Point 1, Point 2. :rtype: tuple """

    assert (isinstance(plane, stypes.Plane))
    assert (isinstance(ellips, stypes.Ellipse))
    nxpts = ctypes.c_int()
    xpt1 = stypes.emptyDoubleVector(3)
    xpt2 = stypes.emptyDoubleVector(3)
    libspice.inelpl_c(ctypes.byref(ellips), ctypes.byref(plane),
                      ctypes.byref(nxpts), xpt1, xpt2)
    return nxpts.value, stypes.cVectorToPython(xpt1), stypes.cVectorToPython(xpt2)