A simple graph is said to be cordial if it admits 0-1 labeling that satisfies certain conditions. In this paper we investigate necessary and sufficient conditions for cordial labeling of the corona product between paths and fourth power of paths be cordial.