It is well known that Shor's algorithm is a revolutionary quantum algorithm designed to find the two prime factors of a large integer that is a product of these primes. Since then, several research groups have worked on implementing this algorithm, but for factorizing numbers like 15, 21, 35, etc., because of quantum hardware's limitations in efficiently handling many qubits. All these examples are similar in the sense that they are expressible as the product of two distinct prime factors. However, in this paper, we attempt to implement Shor's algorithm for a perfect square, say, 49, and present our observations.