| Wireless Sensor Networks (WSNs) can be used to monitor targets continuously. This assumes sensor nodes have {\em energy neutral} operation, whereby the energy consumed to monitor targets is less than their harvested energy. In this paper, we consider a new problem: Minimum Energy Harvesting Node Placement for Energy Neutral Coverage and Connectivity (MEHNP-ENCC). We aim to determine the locations to place the minimal number of nodes used for sensing and relaying such that deployed nodes (i) cover all targets, (ii) have a path to the sink, and (iii) have energy neutral operation. We first model MEHNP-ENCC as a Mixed Integer Linear Program (MILP). After that we propose a MILP-based approach called GMILP whereby a greedy heuristic is used to generate a collection of locations. We also propose two heuristics: (i) DirectSearch considers locations that cover one or more lines connecting targets to the sink whilst (ii) GreedySearch also considers locations farther afield from the said lines that have a high recharging rate. Simulation results show that DirectSearch requires 20\% more sensor nodes than the optimal solution whilst this value is 10\% for GreedySearch and GMILP. |