sub sort_n {
   return
   map  {
           $_->[0]
        }
   sort {
           my $l = @{$a->[1]} < @{$b->[1]} ? @{$a->[1]} : @{$b->[1]};
           for (my $n=0; $n<$l; $n++) {
              my $A = $a->[1][$n];
              my $B = $b->[1][$n];
              my $tmp;
              if ($A =~ /\d/) {
                 if ($B =~ /\d/) { $tmp = $A <=> $B; }
                            else { $tmp = -1;        }
              } else {
                 if ($B =~ /\d/) { $tmp = 1;         }
                            else { $tmp = $A cmp $B; }
              }
              return $tmp if $tmp;
           }
           return @{$a->[1]} <=> @{$b->[1]};
        }
   map  {
           [ $_ , [ split( /(\d+)/, $_ ) ] ]
        }
   @_;
}
[download]