For a family \({\mathcal F}\) of \(k\)-uniform hypergraphs, let \(\text{ex}(n,{\mathcal F})\) denote the maximum number of hyperedges a \(k\)-uniform hypergraph on \(n\) vertices can have without containing a subhypergraph isomorphic to a hypergraph of the family \({\mathcal F}\). Since \(\text{ex}(n,{\mathcal F}) / \binom{n}{k}\) is non-increasing with \(n\), its limit for \(n\) tending to infinity exists. It is called the Turán density of \({\mathcal F}\) and denoted by \(\pi({\mathcal F})\). It is shown that for each \(k \geq 3\), there is an \({\mathcal F}\) such that \(|{\mathcal F}| = 2\) and \(\pi({\mathcal F}) < \pi(\{F\})\) for all \(F \in {\mathcal F}\). The same result is also shown for the Ramsey--Turán density.