571 {
572 int n;
573 cin >> n;
574 int a_win = 0;
575 int b_win = 0;
576 int a_win_count[3] = {};
577 int b_win_count[3] = {};
578 int tie = 0;
579 for(int i = 0; i < n; i++) {
584 tie++;
585 } else if(a == 'C' && b == 'J' || a == 'J' && b == 'B' || a == 'B' && b == 'C') {
586 a_win++;
587 switch(a) {
588 case 'B':
589 a_win_count[0]++;
590 break;
591 case 'C':
592 a_win_count[1]++;
593 break;
594 case 'J':
595 a_win_count[2]++;
596 break;
597 }
598 } else {
599 b_win++;
600 switch(b) {
601 case 'B':
602 b_win_count[0]++;
603 break;
604 case 'C':
605 b_win_count[1]++;
606 break;
607 case 'J':
608 b_win_count[2]++;
609 break;
610 }
611 }
612 }
613 cout << a_win << ' ' << tie << ' ' << b_win << endl
614 << b_win << ' ' << tie << ' ' << a_win << endl;
615 int a_win_max = 0;
616 int b_win_max = 0;
617 for(int i = 0; i < 3; i++) {
618 a_win_max = max(a_win_max, a_win_count[i]);
619 b_win_max = max(b_win_max, b_win_count[i]);
620 }
621 for(int i = 0; i < 3; i++) {
622 if(a_win_count[i] == a_win_max) {
623 switch(i) {
624 case 0:
625 cout << 'B';
626 break;
627 case 1:
628 cout << 'C';
629 break;
630 case 2:
631 cout << 'J';
632 break;
633 }
634 cout << ' ';
635 break;
636 }
637 }
638 for(int i = 0; i < 3; i++) {
639 if(b_win_count[i] == b_win_max) {
640 switch(i) {
641 case 0:
642 cout << 'B';
643 break;
644 case 1:
645 cout << 'C';
646 break;
647 case 2:
648 cout << 'J';
649 break;
650 }
651 break;
652 }
653 }
654 return 0;
655 }