---
id: 5900f5481000cf542c51005a
challengeType: 5
title: 'Problem 475: Music festival'
forumTopicId: 302152
---

## Description
<section id='description'>
12n musicians participate at a music festival. On the first day, they form 3n quartets and practice all day.
It is a disaster. At the end of the day, all musicians decide they will never again agree to play with any member of their quartet.
On the second day, they form 4n trios, each musician avoiding his previous quartet partners.

Let f(12n) be the number of ways to organize the trios amongst the 12n musicians.
You are given f(12) = 576 and f(24) mod 1 000 000 007 = 509089824.

Find f(600) mod 1 000 000 007.
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler475()</code> should return 75780067.
    testString: assert.strictEqual(euler475(), 75780067);

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler475() {
  // Good luck!
  return true;
}

euler475();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

</section>