This paper models a Static Collusion in repeated First Price Auctions, that is, a bid rotation scheme which uses the same instruction rule throughout the collusion phase independent of the history. In this environment, we allow that bidders send cheap talk messages to each other about their ranking of preferences over goods that will be auctioned during the stage game. We can show that the introduction of the cheap talk messages improves the bidder`s aggregated surplus compared to tacit static collusion models. Moreover, the dominance of dynamic bid rotation schemes, as showed by Aoyagi (2002), on static versions is not necessarily truth. Another remark is that refining the cheap talk mechanism, by the extension of ranking chain, although generates larger expected receipts, may increases the minimum necessary patience rate to sustain collusion.