An elongated ply \( T(n; t^{(1)}, t^{(2)}, \ldots, t^{(n)}) \) is a snake of \( n \) number of plys \( P_{t(i)} (u_i, u_{i+1}) \) where any two adjacent plys \( P_{t(i)} \) and \( P_{t(i+1)} \) have only the vertex \( u_{i+1} \) in common. That means the block cut vertex graph of \( T_n \) is thus a path of length \( n – 1 \). In this paper, the cordiality of the Elongated Ply \( T_n \) is investigated.