A 2-packing of a hypergraph H is a permutation σ on V(H) such that if an edge e belongs to E(H), then σ(e) does not belong to E(H). Let H be a hypergraph of order n which contains edges of cardinality at least 2 and at most n-2. We prove that if H has at most n-2 edges then it is 2-packable.